Paper Review Records
All Paper Review Records
7 valid samples · Newest publication first
Review days = acceptance date − received date. PDF, DOI, and publisher-page sources are retained.
Space-bounded quantum state testing via space-efficient quantum singular value transformation
François Le Gall; Yupan Liu; Qisheng WangShow moreShow less
1. Graduate School of Mathematics, Nagoya University, Nagoya, Japan; 2. School of Computer and Communication Sciences, École Polytechnique Fédérale de Lausanne, Lausanne, Switzerland; 3. School of Informatics, University of Edinburgh, Edinburgh, UKShow moreShow less
On the Composition of Randomized Query Complexity and Approximate Degree
Sourav Chakraborty; Chandrima Kayal; Rajat Mittal; Manaswi Paraashar; Swagato Sanyal; Nitin SaurabhShow moreShow less
1. Indian Statistical Institute, Kolkata, India; 2. Université Paris Cité, CNRS, IRIF, Paris, France; 3. Indian Institute of Technology, Kanpur, India; 4. Indian Institute of Technology, Hyderabad, India; 5. University of Sheffield, Sheffield, UKShow moreShow less
A strong direct sum theorem for distributional query complexity
Guy Blanc; Caleb Koch; Carmen Strassle; Li-Yang TanShow moreShow less
1. Department of Computer Science, Stanford University, Stanford, USAShow moreShow less
Polynomial time classical versus quantum algorithms for representation theoretic multiplicities
Greta PanovaShow moreShow less
1. University of Southern California, Los Angeles, USAShow moreShow less
Lifting Dichotomies
Yaroslav Alekseev; Yuval Filmus; Alexander V. SmalShow moreShow less
1. The Taub Faculty of Computer Science, Technion —Israel Institute of Technology, Haifa, Israel; 2. The Taub Faculty of Computer Science and Faculty of Mathematics, Technion —Israel Institute of Technology, Haifa, Israel; 3. JetBrains Research, Limassol, CyprusShow moreShow less
Separation of the Factorization Norm and Randomized Communication Complexity
Tsun-Ming Cheung; Hamed Hatami; Kaave Hosseini; Morgan ShirleyShow moreShow less
1. Institute of Information Science, Academia Sinica, Taipei, Taiwan; 2. School of Computer Science, McGill University, Montreal, Canada; 3. Department of Computer Science, University of Rochester, New York, USA; 4. Department of Computer Science, University of Victoria, Vancouver Island, CanadaShow moreShow less
FAQ
How long does COMPUTATIONAL COMPLEXITY take to review a manuscript?
As of 2026-11-18, CrushSCI has 7 complete review records for COMPUTATIONAL COMPLEXITY. The fastest paper went from submission to acceptance in 4 days (Separation of the Factorization Norm and Randomized Communication Complexity, received 2025-08-31, accepted 2025-09-04); the slowest took 465 days. The average is 209 days and the median is 215 days. The fastest record has an unusually short interval; please check the original source.
Expert Matching · Case Demo
Turn Your Submission Goalsinto a Verifiable Journal Plan
Share your field, deadline, and author profile. CrushSCI uses real review records to suggest a title direction, shortlist journals, and estimate timelines.
