![](https://dblp.uni-trier.de./img/logo.320x120.png)
![search dblp search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
default search action
ACM Transactions on Computation Theory, Volume 4
Volume 4, Number 1, March 2012
- Seiichiro Tani
, Hirotada Kobayashi, Keiji Matsumoto:
Exact Quantum Algorithms for the Leader Election Problem. 1:1-1:24 - Mahdi Cheraghchi
, Johan Håstad
, Marcus Isaksson, Ola Svensson:
Approximating Linear Threshold Predicates. 2:1-2:31 - Anindya De, Thomas Watson:
Extractors and Lower Bounds for Locally Samplable Sources. 3:1-3:21
Volume 4, Number 2, May 2012
- Grant Schoenebeck
, Salil P. Vadhan:
The Computational Complexity of Nash Equilibria in Concisely Represented Games. 4:1-4:50 - Akitoshi Kawamura, Stephen A. Cook:
Complexity Theory for Operators in Analysis. 5:1-5:24 - Paolo Penna, Carmine Ventre
:
Collusion-Resistant Mechanisms with Verification Yielding Optimal Solutions. 6:1-6:17
Volume 4, Number 3, September 2012
- Olaf Beyersdorff
, Nicola Galesi, Massimo Lauria
, Alexander A. Razborov:
Parameterized Bounded-Depth Frege Is not Optimal. 7:1-7:16 - Thomas Watson:
Relativized Worlds without Worst-Case to Average-Case Reductions for NP. 8:1-8:30
Volume 4, Number 4, November 2012
- Neeraj Kayal, Chandan Saha:
On the Sum of Square Roots of Polynomials and Related Problems. 9:1-9:15 - Rafael Pass
, Muthuramakrishnan Venkitasubramaniam:
A Parallel Repetition Theorem for Constant-Round Arthur-Merlin Proofs. 10:1-10:22 - Dana Ron
, Ronitt Rubinfeld, Muli Safra
, Alex Samorodnitsky, Omri Weinstein:
Approximating the Influence of Monotone Boolean Functions in O(√n) Query Complexity. 11:1-11:12 - Nikos Vlassis, Michael L. Littman, David Barber:
On the Computational Complexity of Stochastic Controller Optimization in POMDPs. 12:1-12:8
![](https://dblp.uni-trier.de./img/cog.dark.24x24.png)
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.