default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputational Complexity, Volume 23
Volume 23, Number 1, March 2014
- Amos Beimel
, Sebastian Ben Daniel, Eyal Kushilevitz, Enav Weinreb:
Choosing, Agreeing, and Eliminating in Communication Complexity. 1-42 - Sergei Artemenko, Ronen Shaltiel:
Lower Bounds on the Query Complexity of Non-uniform and Adaptive Reductions Showing Hardness Amplification. 43-83 - Brady Garvin, Derrick Stolee, Raghunath Tewari, N. V. Vinodchandran:
ReachFewL = ReachUL. 85-98 - Matei David, Periklis A. Papakonstantinou:
Tradeoff lower lounds for stack machines. 99-146
Volume 23, Number 2, June 2014
- Christopher Umans:
Special Issue "Conference on Computational Complexity 2013" Guest editor's foreword. 147-149 - Daniel M. Kane:
The correct exponent for the Gotsman-Linial Conjecture. 151-175 - Rahul Santhanam, Ryan Williams:
On Uniformity and Circuit Lower Bounds. 177-205 - Ankit Gupta, Neeraj Kayal, Youming Qiao:
Random arithmetic formulas can be reconstructed efficiently. 207-303 - Andris Ambainis, Ronald de Wolf:
How Low can Approximate Degree and Quantum Query Complexity be for Total Boolean Functions? 305-322 - Aleksandrs Belovs, Ansis Rosmanis:
On the Power of Non-adaptive Learning Graphs. 323-354
Volume 23, Number 3, September 2014
- Or Meir:
Combinatorial PCPs with Efficient Verifiers. 355-478 - Emanuele Viola:
Randomness Buys Depth for Approximate Counting. 479-508
Volume 23, Number 4, December 2014
- Zeev Dvir, János Kollár, Shachar Lovett:
Variety Evasive Sets. 509-529 - Abhinav Kumar, Satyanarayana V. Lokam, Vijay M. Patankar, Jayalal Sarma:
Using Elimination Theory to Construct Rigid Matrices. 531-563 - Jason Teutsch:
Short lists for shortest descriptions in short time. 565-583 - Alexis Maciel, Phuong Nguyen, Toniann Pitassi:
Lifting lower bounds for tree-like proofs. 585-636 - Martin Mundhenk, Felix Weiss:
An AC 1-complete model checking problem for intuitionistic logic. 637-669
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-12-14 23:10 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:
