IEEE Conference on Computational Complexity - researchr conference series publications

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 100 from 698

2025

A Min-Entropy Approach to Multi-Party Communication Lower BoundsMi-Ying (Miryam) Huang, Xinyu Mao, Shuo Wang, Guangxu Yang, Jiapeng Zhang. coco 2025: [doi]

40th Computational Complexity Conference, CCC 2025, August 5-8, 2025, Toronto, CanadaSrikanth Srinivasan 0001, editor, Volume 339 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. [doi]

Algebraic Pseudorandomness in VNC⁰Robert Andrews 0003. coco 2025: [doi]

Front Matter, Table of Contents, Preface, Conference Organizationcoco 2025: [doi]

Generalised Linial-Nisan Conjecture Is False for DNFsYaroslav Alekseev, Mika Göös, Ziyi Guan, Gilbert Maystre, Artur Riazanov, Dmitry Sokolov 0001, Weiqiang Yuan 0002. coco 2025: [doi]

Directed st-Connectivity with Few Paths Is in Quantum LogspaceSimon Apers, Roman Edenhofer. coco 2025: [doi]

Towards Free Lunch Derandomization from Necessary Assumptions (And OWFs)Marshall Ball, Lijie Chen 0001, Roei Tell. coco 2025: [doi]

Direct Sums for Parity Decision TreesTyler Besselman, Mika Göös, Siyao Guo, Gilbert Maystre, Weiqiang Yuan 0002. coco 2025: [doi]

Hardness of Clique Approximation for Monotone CircuitsJaroslaw Blasiok, Linus Meierhöfer. coco 2025: [doi]

On the Automatability of Tree-Like k-DNF ResolutionGaia Carenini, Susanna F. de Rezende. coco 2025: [doi]

Super-Critical Trade-Offs in Resolution over Parities via LiftingArkadev Chattopadhyay, Pavel Dvorák. coco 2025: [doi]

Lifting with Colourful SunflowersSusanna F. de Rezende, Marc Vinyals. coco 2025: [doi]

Sparser Abelian High Dimensional ExpandersYotam Dikstein, Siqi Liu 0005, Avi Wigderson. coco 2025: [doi]

New Codes on High Dimensional ExpandersIrit Dinur, Siqi Liu 0005, Rachel Yun Zhang. coco 2025: [doi]

Online Condensing of Unpredictable Sources via Random WalksDean Doron, Dana Moshkovitz, Justin Oh, David Zuckerman. coco 2025: [doi]

Amortized Closure and Its Applications in Lifting for Resolution over ParitiesKlim Efremenko, Dmitry Itsykson. coco 2025: [doi]

Provably Total Functions in the Polynomial HierarchyNoah Fleming, Deniz imrek, Christophe Marciot. coco 2025: [doi]

Space-Bounded Quantum Interactive Proof SystemsFrançois Le Gall, Yupan Liu, Harumichi Nishimura, Qisheng Wang. coco 2025: [doi]

Witness Encryption and NP-Hardness of LearningHalley Goldberg, Valentine Kabanets. coco 2025: [doi]

Quantum LDPC Codes of Almost Linear Distance via Iterated Homological ProductsLouis Golowich, Venkatesan Guruswami. coco 2025: [doi]

List Decoding Quotient Reed-Muller CodesOmri Gotlib, Tali Kaufman, Shachar Lovett. coco 2025: [doi]

Quantum Threshold Is PowerfulDaniel Grier, Jackson Morris. coco 2025: [doi]

Tight Bounds for Stream Decodable Error-Correcting CodesMeghal Gupta, Venkatesan Guruswami, Mihir Singhal. coco 2025: [doi]

Counting Martingales for Measure and Dimension in Complexity ClassesJohn M. Hitchcock, Adewale Sekoni, Hadi Shafei. coco 2025: [doi]

Biased Linearity Testing in the 1% RegimeSubhash Khot, Kunal Mittal. coco 2025: [doi]

How to Construct Random StringsOliver Korten, Rahul Santhanam. coco 2025: [doi]

Pseudorandom Bits for Non-Commutative ProgramsChin Ho Lee, Emanuele Viola. coco 2025: [doi]

Hardness Amplification for Real-Valued FunctionsYunqi Li, Prashant Nalini Vasudevan. coco 2025: [doi]

Characterizing the Distinguishability of Product Distributions Through MulticalibrationCassandra Marcussen, Aaron Putterman, Salil P. Vadhan. coco 2025: [doi]

Improved Separation Between Quantum and Classical Computers for Sampling and Functional TasksSimon C. Marshall, Scott Aaronson, Vedran Dunjko. coco 2025: [doi]

From an Odd Arity Signature to a Holant DichotomyBoning Meng, Juqiu Wang, Mingji Xia, Jiayi Zheng. coco 2025: [doi]

New Lower-Bounds for Quantum Computation with Non-Collapsing MeasurementsDavid Miloschewsky, Supartha Podder. coco 2025: [doi]

Reconstruction of Depth 3 Arithmetic Circuits with Top Fan-In 3Shubhangi Saraf, Devansh Shringi. coco 2025: [doi]

Multiplicative Extractors for Samplable DistributionsRonen Shaltiel. coco 2025: [doi]

A Lower Bound for k-DNF Resolution on Random CNF Formulas via ExpansionAnastasia Sofronova, Dmitry Sokolov 0001. coco 2025: [doi]

Algebraic Metacomplexity and Representation TheoryMaxim van den Berg, Pranjal Dutta, Fulvio Gesmundo, Christian Ikenmeyer, Vladimir Lysikov. coco 2025: [doi]

Switching Graph Matrix Norm Bounds: From i.i.d. to Random Regular GraphsJeff Xu. coco 2025: [doi]

Near-Optimal Averaging Samplers and Matrix SamplersZhiyang Xun, David Zuckerman. coco 2025: [doi]

2024

Low-Depth Algebraic Circuit Lower Bounds over Any FieldMichael A. Forbes 0001. coco 2024: [doi]

Explicit Directional Affine Extractors and Improved Hardness for Linear Branching ProgramsXin Li 0006, Yan Zhong 0002. coco 2024: [doi]

Front Matter, Table of Contents, Preface, Conference Organizationcoco 2024: [doi]

Distribution-Free Proofs of ProximityHugo Aaronson, Tom Gur, Ninad Rajgopal, Ron D. Rothblum. coco 2024: [doi]

Lifting DichotomiesYaroslav Alekseev, Yuval Filmus, Alexander Smal. coco 2024: [doi]

Finer-Grained Hardness of Kernel Density EstimationJosh Alman, Yunfeng Guan. coco 2024: [doi]

Quantum Automating TC⁰-Frege Is LWE-HardNoel Arteche, Gaia Carenini, Matthew Gray. coco 2024: [doi]

Polynomial Pass Semi-Streaming Lower Bounds for K-Cores and DegeneracySepehr Assadi, Prantar Ghosh, Bruno Loff, Parth Mittal, Sagnik Mukhopadhyay. coco 2024: [doi]

Solving Unique Games over Globally Hypercontractive GraphsMitali Bafna, Dor Minzer. coco 2024: [doi]

Exponential Separation Between Powers of Regular and General Resolution over ParitiesSreejata Kishor Bhattacharya, Arkadev Chattopadhyay, Pavel Dvorák. coco 2024: [doi]

A Strong Direct Sum Theorem for Distributional Query ComplexityGuy Blanc, Caleb Koch, Carmen Strassle, Li-Yang Tan. coco 2024: [doi]

Public-Key Pseudoentanglement and the Hardness of Learning Ground State Entanglement StructureAdam Bouland, Bill Fefferman, Soumik Ghosh, Tony Metger, Umesh V. Vazirani, Chenyi Zhang, Zixin Zhou. coco 2024: [doi]

Complexity of Robust Orbit Problems for Torus Actions and the abc-ConjecturePeter Bürgisser, Mahmut Levent Dogan, Visu Makam, Michael Walter 0005, Avi Wigderson. coco 2024: [doi]

Finding Missing Items Requires Strong Forms of RandomnessAmit Chakrabarti, Manuel Stoeckl. coco 2024: [doi]

Lower Bounds for Set-Multilinear Branching ProgramsPrerona Chatterjee, Deepanshu Kush, Shubhangi Saraf, Amir Shpilka. coco 2024: [doi]

BPL ⊆ L-AC¹Kuan Cheng, Yichuan Wang. coco 2024: [doi]

Asymptotically-Good RLCCs with (log n)^(2+o(1)) QueriesGil Cohen, Tal Yankovitz. coco 2024: [doi]

Explicit Time and Space Efficient Encoders Exist Only with Random AccessJoshua Cook, Dana Moshkovitz. coco 2024: [doi]

Streaming Zero-Knowledge ProofsGraham Cormode, Marcel Dall'Agnol, Tom Gur, Chris Hickey. coco 2024: [doi]

Pseudorandomness, Symmetry, Smoothing: IHarm Derksen, Peter Ivanov, Chin Ho Lee, Emanuele Viola. coco 2024: [doi]

The Computational Advantage of MIP^∗ Vanishes in the Presence of NoiseYangjing Dong, Honghao Fu, Anand Natarajan, Minglong Qin, Haochen Xu, Penghui Yao. coco 2024: [doi]

Information Dissemination via Broadcasts in the Presence of Adversarial NoiseKlim Efremenko, Gillat Kol, Dmitry Paramonov, Ran Raz, Raghuvansh R. Saxena. coco 2024: [doi]

Failure of Feasible Disjunction Property for k-DNF Resolution and NP-Hardness of Automating ItMichal Garlík. coco 2024: [doi]

The Entangled Quantum Polynomial Hierarchy CollapsesSabee Grewal, Justin Yirka. coco 2024: [doi]

Local Enumeration and Majority Lower BoundsMohit Gurumukhani, Ramamohan Paturi, Pavel Pudlák, Michael E. Saks, Navid Talebanfard. coco 2024: [doi]

Baby PIH: Parameterized Inapproximability of Min CSPVenkatesan Guruswami, Xuandi Ren, Sai Sandeep. coco 2024: [doi]

Exact Search-To-Decision Reductions for Time-Bounded Kolmogorov ComplexityShuichi Hirahara, Valentine Kabanets, Zhenjian Lu, Igor C. Oliveira. coco 2024: [doi]

Linear-Size Boolean Circuits for MultiselectionJustin Holmgren, Ron Rothblum. coco 2024: [doi]

A Technique for Hardness Amplification Against AC⁰William M. Hoza. coco 2024: [doi]

A Subquadratic Upper Bound on Sum-Of-Squares Composition FormulasPavel Hrubes. coco 2024: [doi]

Hard Submatrices for Non-Negative Rank and Communication ComplexityPavel Hrubes. coco 2024: [doi]

Dimension Independent Disentanglers from Unentanglement and ApplicationsFernando Granha Jeronimo, Pei Wu. coco 2024: [doi]

On the Degree of Polynomials Computing Square Roots Mod pKiran S. Kedlaya, Swastik Kopparty. coco 2024: [doi]

Gap MCSP Is Not (Levin) NP-Complete in ObfustopiaNoam Mazor, Rafael Pass. coco 2024: [doi]

Search-To-Decision Reductions for Kolmogorov ComplexityNoam Mazor, Rafael Pass. coco 2024: [doi]

Depth-d Frege Systems Are Not Automatable Unless P = NPTheodoros Papamakarios. coco 2024: [doi]

Derandomizing Logspace with a Small Shared Hard DriveEdward Pyne. coco 2024: [doi]

39th Computational Complexity Conference, CCC 2024, July 22-25, 2024, Ann Arbor, MI, USARahul Santhanam, editor, Volume 300 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. [doi]

2023

Border Complexity of Symbolic Determinant Under Rank One RestrictionAbhranil Chatterjee 0001, Sumanta Ghosh, Rohit Gurjar, Roshan Raj. coco 2023: [doi]

Front Matter, Table of Contents, Preface, Conference Organizationcoco 2023: [doi]

An Improved Trickle down Theorem for Partite ComplexesDorna Abdolazimi, Shayan Oveis Gharan. coco 2023: [doi]

Translationally Invariant Constraint Optimization ProblemsDorit Aharonov, Sandy Irani. coco 2023: [doi]

Matrix Multiplication and Number on the Forehead CommunicationJosh Alman, Jaroslaw Blasiok. coco 2023: [doi]

Sum-Of-Squares Lower Bounds for the Minimum Circuit Size ProblemPer Austrin, Kilian Risse. coco 2023: [doi]

The Optimal Depth of Variational Quantum Algorithms Is QCMA-Hard to ApproximateLennart Bittel, Sevag Gharibian, Martin Kliesch. coco 2023: [doi]

Constant-Depth Circuits vs. Monotone CircuitsBruno Pasqualotto Cavalar, Igor C. Oliveira. coco 2023: [doi]

New Lower Bounds Against Homogeneous Non-Commutative CircuitsPrerona Chatterjee, Pavel Hrubes. coco 2023: [doi]

Hardness Against Linear Branching Programs and MoreEshan Chattopadhyay, Jyun-Jie Liao. coco 2023: [doi]

Separation of the Factorization Norm and Randomized Communication ComplexityTsunMing Cheung, Hamed Hatami, Kaave Hosseini, Morgan Shirley. coco 2023: [doi]

A Ihara-Bass Formula for Non-Boolean Matrices and Strong Refutations of Random CSPsTommaso d'Orsi, Luca Trevisan. coco 2023: [doi]

Colourful TFNP and Propositional ProofsBen Davis, Robert Robere. coco 2023: [doi]

Radical Sylvester-Gallai Theorem for Tuples of QuadraticsAbhibhav Garg, Rafael Oliveira 0006, Shir Peleg, Akash Kumar Sengupta. coco 2023: [doi]

Improved Learning from Kolmogorov ComplexityHalley Goldberg, Valentine Kabanets. coco 2023: [doi]

Generative Models of Huge ObjectsLunjia Hu, Inbal Livni Navon, Omer Reingold. coco 2023: [doi]

Lower Bounds for Polynomial Calculus with Extension Variables over Finite FieldsRussell Impagliazzo, Sasank Mouli, Toniann Pitassi. coco 2023: [doi]

Tight Correlation Bounds for Circuits Between AC0 and TC0Vinayak M. Kumar. coco 2023: [doi]

A Degree 4 Sum-Of-Squares Lower Bound for the Clique Number of the Paley GraphDmitriy Kunisky, Xifan Yu. coco 2023: [doi]

Near-Optimal Set-Multilinear Formula Lower BoundsDeepanshu Kush, Shubhangi Saraf. coco 2023: [doi]

A Distribution Testing Oracle Separating QMA and QCMAAnand Natarajan, Chinmay Nirkhe. coco 2023: [doi]

An Algorithmic Approach to Uniform Lower BoundsRahul Santhanam. coco 2023: [doi]

38th Computational Complexity Conference, CCC 2023, July 17-20, 2023, Warwick, UKAmnon Ta-Shma, editor, Volume 264 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. [doi]

Instance-Wise Hardness Versus Randomness Tradeoffs for Arthur-Merlin ProtocolsDieter van Melkebeek, Nicollas M. Sdroievski. coco 2023: [doi]

Links

Filter by Year

[-]
OR AND NOT 1

Filter by Tag

[+]
OR AND NOT 1

Filter by Author

[+]
OR AND NOT 1

Filter by Top terms

[+]
OR AND NOT 1

IEEE Conference on Computational Complexity (coco)

Viewing Publication 1 - 100 from 698

2025

2024

2023

Links

Filter by Year [-]OR AND NOT 1

Filter by Tag [+]OR AND NOT 1

Filter by Author [+]OR AND NOT 1

Filter by Top terms [+]OR AND NOT 1

IEEE Conference on Computational Complexity (coco)

Viewing Publication 1 - 100 from 698

2025

2024

2023

Filter by Year

[-]
OR AND NOT 1

Filter by Tag

[+]
OR AND NOT 1

Filter by Author

[+]
OR AND NOT 1

Filter by Top terms

[+]
OR AND NOT 1