default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDACM Transactions on Computation Theory, Volume 6
Volume 6, Number 1, March 2014
- Anil Ada, Arkadev Chattopadhyay, Stephen A. Cook, Lila Fontes, Michal Koucký
, Toniann Pitassi:
The Hardness of Being Private. 1:1-1:24 - Per Austrin, Ryan O'Donnell, Li-Yang Tan, John Wright:
New NP-Hardness Results for 3-Coloring and 2-to-1 Label Cover. 2:1-2:20 - Christian Glaßer, John M. Hitchcock, Aduri Pavan, Stephen D. Travers:
Unions of Disjoint NP-Complete Sets. 3:1-3:10 - Shu-Ming Sun, Ning Zhong:
On Effective Convergence of Numerical Solutions for Differential Equations. 4:1-4:25 - Ryan O'Donnell, Yi Wu, Yuan Zhou:
Optimal Lower Bounds for Locality-Sensitive Hashing (Except When q is Tiny). 5:1-5:13
Volume 6, Number 2, May 2014
- Marek Cygan, Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Magnus Wahlström:
Clique Cover and Graph Separation: New Incompressibility Results. 6:1-6:19 - Yijia Chen, Jörg Flum, Moritz Müller:
Hard Instances of Algorithms and Proof Systems. 7:1-7:25 - Leslie Ann Goldberg, Mark Jerrum:
The Complexity of Approximately Counting Tree Homomorphisms. 8:1-8:31 - Kousha Etessami, Alistair Stewart, Mihalis Yannakakis:
A Note on the Complexity of Comparing Succinctly Represented Integers, with an Application to Maximum Probability Parsing. 9:1-9:23
Volume 6, Number 3, July 2014
- Eric Allender, Shafi Goldwasser:
Introduction to the Special Issue on Innovations in Theoretical Computer Science 2012 - Part II. 10:1 - Varun Kanade, Thomas Steinke:
Learning Hurdles for Sleeping Experts. 11:1-11:16 - Paul Valiant:
Evolvability of Real Functions. 12:1-12:19 - Zvika Brakerski, Craig Gentry, Vinod Vaikuntanathan:
(Leveled) Fully Homomorphic Encryption without Bootstrapping. 13:1-13:36 - James Cook, Omid Etesami, Rachel Miller, Luca Trevisan:
On the One-Way Function Candidate Proposed by Goldreich. 14:1-14:35
Volume 6, Number 4, August 2014
- Stephen A. Cook, Yuval Filmus, Dai Tri Man Le:
The complexity of the comparator circuit value problem. 15:1-15:44 - Michael R. Fellows, Bart M. P. Jansen:
FPT is characterized by useful obstruction sets: Connecting algorithms, kernels, and quasi-orders. 16:1-16:26 - Andreas Göbel, Leslie Ann Goldberg, David Richerby:
The complexity of counting homomorphisms to cactus graphs modulo 2. 17:1-17:29
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 2024-11-07 20:19 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:
