default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDACM Transactions on Computation Theory, Volume 16
Volume 16, Number 1, March 2024
- Ashley Montanaro
, Changpeng Shao:
Quantum Communication Complexity of Linear Regression. 1:1-1:30 - Joshua A. Grochow, Youming Qiao:
On p-Group Isomorphism: Search-to-Decision, Counting-to-Decision, and Nilpotency Class Reductions via Tensors. 2:1-2:39 - Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli:
Tight Sum-of-squares Lower Bounds for Binary Polynomial2 Optimization Problems. 3:1-3:16 - Bart M. P. Jansen, Michal Wlodarczyk:
Optimal Polynomial-Time Compression for Boolean Max CSP. 4:1-4:20
Volume 16, Number 2, June 2024
- Jin-Yi Cai, Daniel P. Szabo:
Bounded Degree Nonnegative Counting CSP. 5:1-5:18 - Olaf Beyersdorff, Joshua Blinkhorn, Meena Mahajan, Tomás Peitl, Gaurav Sood:
Hard QBFs for Merge Resolution. 6:1-6:24 - Dean Doron, Jack Murtagh, Salil P. Vadhan, David Zuckerman:
Small-Space Spectral Sparsification via Bounded-Independence Sampling. 7:1-7:32 - Konrad Majewski, Tomás Masarík, Jana Masaríková, Karolina Okrasa, Marcin Pilipczuk, Pawel Rzazewski, Marek Sokolowski:
Max Weight Independent Set in Graphs with No Long Claws: An Analog of the Gyárfás' Path Argument. 8:1-8:18 - Nikhil S. Mande, Swagato Sanyal:
On parity decision trees for Fourier-sparse Boolean functions. 9:1-9:26 - Manuel Bodirsky, Bertalan Bodor:
A Complexity Dichotomy in Spatial Reasoning via Ramsey Theory. 10:1-10:39 - Daniel J. Rosenkrantz, Madhav V. Marathe, S. S. Ravi, Richard Edwin Stearns:
Synchronous Dynamical Systems on Directed Acyclic Graphs: Complexity and Algorithms. 11:1-11:34 - Anup Bhattacharya, Arijit Bishnu, Arijit Ghosh, Gopinath Mishra:
Faster Counting and Sampling Algorithms using Colorful Decision Oracle. 12:1-12:19
Volume 16, Number 3, September 2024
- Emirhan Gürpinar, Andrei E. Romashchenko:
Communication Complexity of the Secret Key Agreement in Algorithmic Information Theory. 13:1-13:37 - Chandan Saha, Bhargav Thankey:
Hitting Sets for Orbits of Circuit Classes and Polynomial Families. 14:1-14:50 - Svyatoslav Gryaznov, Sergei Ovcharov, Artur Riazanov:
Resolution Over Linear Equations: Combinatorial Games for Tree-like Size and Space. 15:1-15:15 - Michael Kuhn, Daniel Lokshtanov, Zachary Miller:
Lower Bound for Independence Covering in C4-free Graphs. 16:1-16:7 - Michael Lampis, Manolis Vasilakis:
Structural Parameterizations for Two Bounded Degree Problems Revisited. 17:1-17:51 - Jin-Yi Cai, Ben Young:
Planar #CSP Equality Corresponds to Quantum Isomorphism - A Holant Viewpoint. 18:1-18:41 - Ivan Geffner, Joseph Y. Halpern:
Bounding the communication complexity of fault-tolerant common coin tossing. 19:1-19:10
Volume 16, Number 4, December 2024
- Lane A. Hemaspaandra, Mandar Juvekar, Arian Nadjimzadah, Patrick A. Phillips:
Gaps, Ambiguity, and Establishing Complexity-Class Containments via Iterative Constant-Setting. 20:1-20:26 - Srinivasan Arunachalam, João F. Doriguello:
Matrix hypercontractivity, streaming algorithms and LDCs: the large alphabet case. 21:1-21:38 - Olaf Beyersdorff, Joshua Lewis Blinkhorn, Tomás Peitl:
Strong (D)QBF Dependency Schemes via Implication-free Resolution Paths. 22:1-22:25 - C. S. Bhargav, Sagnik Dutta, Nitin Saxena:
Improved Lower Bound, and Proof Barrier, for Constant Depth Algebraic Circuits. 23:1-23:22
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-01-13 21:35 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
