default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDACM Transactions on Computation Theory, Volume 7
Volume 7, Number 1, December 2014
- Thomas Watson:
Advice Lower Bounds for the Dense Model Theorem. 1:1-1:18 - Pranjal Awasthi, Madhav Jha, Marco Molinaro, Sofya Raskhodnikova:
Limitations of Local Filters of Lipschitz and Monotone Functions. 2:1-2:16 - Gianluigi Greco, Enrico Malizia
, Luigi Palopoli, Francesco Scarcello:
The Complexity of the Nucleolus in Compact Games. 3:1-3:52 - Stefan Kratsch, Marcin Pilipczuk, Ashutosh Rai, Venkatesh Raman:
Kernel Lower Bounds using Co-Nondeterminism: Finding Induced Hereditary Subgraphs. 4:1-4:18
Volume 7, Number 2, May 2015
- Yuval Filmus, Toniann Pitassi, Rahul Santhanam:
Exponential Lower Bounds for AC0-Frege Imply Superpolynomial Frege Lower Bounds. 5:1-5:16 - Markus Bläser, Bodo Manthey:
Smoothed Complexity Theory. 6:1-6:21 - Hubie Chen, Moritz Müller:
The Fine Classification of Conjunctive Queries and Parameterized Logarithmic Space. 7:1-7:27 - Balagopal Komarath, Jayalal Sarma:
Pebbling, Entropy, and Branching Program Size Lower Bounds. 8:1-8:21 - Ryan O'Donnell, Yi Wu, Yuan Zhou:
Hardness of Max-2Lin and Max-3Lin over Integers, Reals, and Large Cyclic Groups. 9:1-9:16
Volume 7, Number 3, July 2015
- Andris Ambainis, William I. Gasarch, Aravind Srinivasan, Andrey Utis:
Lower Bounds on the Deterministic and Quantum Communication Complexity of Hamming-Distance Problems. 10:1-10:10 - Mark Jerrum, Kitty Meeks:
Some Hard Families of Parameterized Counting Problems. 11:1-11:18 - Adam Case, Jack H. Lutz:
Mutual Dimension. 12:1-12:26 - Henning Fernau, Alejandro López-Ortiz, Jazmín Romero:
Using Parametric Transformations Toward Polynomial Kernels for Packing Problems Allowing Overlaps. 13:1-13:29
Volume 7, Number 4, September 2015
- Pål Grønås Drange, Fedor V. Fomin, Michal Pilipczuk, Yngve Villanger:
Exploring the Subexponential Complexity of Completion Problems. 14:1-14:38 - Oded Regev, Thomas Vidick:
Quantum XOR Games. 15:1-15:43 - Oded Goldreich, Or Meir:
Input-Oblivious Proof Systems and a Uniform Complexity Perspective on P/poly. 16:1-16:13 - Jason Teutsch, Marius Zimand:
On Approximate Decidability of Minimal Programs. 17:1-17:16
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-16 22:15 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:
