default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheory of Computing, Volume 3
Volume 3, Number 1, 2007
- Amos Fiat, Jared Saia:
Censorship Resistant Peer-to-Peer Networks. 1-23 - Uriel Feige, Eran Ofek:
Easily refutable subformulas of large random 3CNF formulas. 25-43 - Ishay Haviv, Oded Regev, Amnon Ta-Shma:
On the Hardness of Satisfiability with Bounded Occurrences in the Polynomial-Time Hierarchy. 45-60 - Dominik Janzing, Pawel Wocjan:
A Simple PromiseBQP-complete Matrix Problem. 61-79 - Michael Alekhnovich, Jan Johannsen, Toniann Pitassi, Alasdair Urquhart:
An Exponential Separation between Regular and General Resolution. 81-102 - David Zuckerman:
Linear Degree Extractors and the Inapproximability of Max Clique and Chromatic Number. 103-128 - Scott Aaronson, Greg Kuperberg:
Quantum Versus Classical Proofs and Advice. 129-157 - Jirí Matousek, Petr Skovron:
Removing Degeneracy May Require a Large Dimension Increase. 159-177 - Maria-Florina Balcan, Avrim Blum:
Approximation Algorithms and Online Mechanisms for Item Pricing. 179-195 - Chandra Chekuri, Martin Pál:
An O(log n) Approximation Ratio for the Asymmetric Traveling Salesman Path Problem. 197-209 - Johan Håstad, Avi Wigderson:
The Randomized Communication Complexity of Set Disjointness. 211-219 - Alexander A. Razborov, Sergey Yekhanin:
An Omega(n1/3) Lower Bound for Bilinear Group Based Private Information Retrieval. 221-238
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-15 19:21 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:
