logo
CanyamAI summaries for academic research
language
MobileMobile
  • Phone FeatureWeChat Mini Program
EnglishEnglish
noticeNotice
BlogBlog
delete
arrow
BackJournal Details
C

Computational Complexity

IF1
Papers15
Citations
Journal Papers 15
Publication Date
delete
On Approximate Symmetric Polynomials and Tightness of Homogenization Results
deleteComputational Complexity
IF1
delete2026-05-07
delete0
PREAI
deleteShpilka, Amir
deleteShare
deleteSave
A strong direct sum theorem for distributional query complexity
deleteComputational Complexity
IF1
delete2026-05-05
delete0
PREAI
deleteBlanc, Guy; Koch, Caleb; Strassle, Carmen; Tan, Li-Yang
deleteShare
deleteSave
Towards Optimal Depth-Reductions for Algebraic Formulas
deleteComputational Complexity
IF1
delete2026-03-08
delete0
PREAI
deleteFournier, Herve; Limaye, Nutan; Malod, Guillaume; Srinivasan, Srikanth; Tavenas, Sebastien
deleteShare
deleteSave
Tight Quantum Lower Bound for Approximate Counting with Quantum States
deleteComputational Complexity
IF1
delete2026-02-10
delete0
PREAI
deleteBelovs, Aleksandrs; Rosmanis, Ansis
deleteShare
deleteSave
Polynomial time classical versus quantum algorithms for representation theoretic multiplicities
deleteComputational Complexity
IF1
delete2025-12-18
delete0
deleteOAAI
deletePanova, Greta
deleteShare
deleteSave
Pseudo-Deterministic Query Complexity of Search Problems
deleteComputational Complexity
IF1
delete2025-11-08
delete0
deleteOAAI
deleteChattopadhyay, Arkadev; Dahiya, Yogesh; Mahajan, Meena
deleteShare
deleteSave
Lifting Dichotomies
deleteComputational Complexity
IF1
delete2025-10-29
delete0
deleteOAAI
deleteAlekseev, Yaroslav; Filmus, Yuval; Smal, Alexander V.
deleteShare
deleteSave
On a Hierarchy of Spectral Isomorphism Invariants
deleteComputational Complexity
IF1
delete2025-10-29
delete0
deleteOAAI
deleteArvind, V.; Fuhlbruck, Frank; Kobler, Johannes; Verbitsky, Oleg
deleteShare
deleteSave
Separation of the Factorization Norm and Randomized Communication Complexity
deleteComputational Complexity
IF1
delete2025-10-27
delete0
PREAI
deleteCheung, Tsun-Ming; Hatami, Hamed; Hosseini, Kaave; Shirley, Morgan
deleteShare
deleteSave
Quantum Automating TC0-Frege Is LWE-Hard
deleteComputational Complexity
IF1
delete2025-10-27
delete0
deleteOAAI
deleteArteche, Noel; Carenini, Gaia; Gray, Matthew
deleteShare
deleteSave
Instance-Wise Hardness and Refutation versus Derandomization for Arthur-Merlin Protocols
deleteComputational Complexity
IF1
delete2025-10-23
delete0
deleteOAAI
deletevan Melkebeek, Dieter; Sdroievski, Nicollas Mocelin
deleteShare
deleteSave
An Exponential Separation Between Quantum Query Complexity and the Polynomial Degree
deleteComputational Complexity
IF1
delete2025-10-03
delete0
PREAI
deleteAmbainis, Andris; Belovs, Aleksandrs
deleteShare
deleteSave
Tractable Unordered 3-CNF Games
deleteCOMPUTATIONAL COMPLEXITY
IF0
delete2025-09-22
delete0
deleteOAAI
deleteRahman, Md Lutfar; Watson, Thomas
deleteShare
deleteSave
Derandomizing Logspace With a Small Shared Hard Drive
deleteCOMPUTATIONAL COMPLEXITY
IF0
delete2025-09-22
delete0
deleteOAAI
deletePyne, Edward
deleteShare
deleteSave
QUANTUM STATE TESTINGBEYOND THE POLARIZING REGIMEAND QUANTUM TRIANGULAR DISCRIMINATION
deleteCOMPUTATIONAL COMPLEXITY
IF0
delete2025-09-17
delete1
deleteOAAI
deleteLiu, Yupan
deleteShare
deleteSave