![](https://dblp.uni-trier.de./img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de./img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de./img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![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 (TOCT), Volume 1
Volume 1, Number 1, February 2009
- Lance Fortnow:
Editor's Foreword. 1:1-1:2 - Scott Aaronson, Avi Wigderson:
Algebrization: A New Barrier in Complexity Theory. 2:1-2:54 - Alexander A. Razborov:
A Simple Proof of Bazzi's Theorem. 3:1-3:5 - Chris Bourke, Raghunath Tewari, N. V. Vinodchandran:
Directed Planar Reachability Is in Unambiguous Log-Space. 4:1-4:17
Volume 1, Number 2, September 2009
- Matei David, Toniann Pitassi, Emanuele Viola:
Improved Separations between Nondeterministic and Randomized Multiparty Communication. 5:1-5:20 - Venkatesan Guruswami, Prasad Raghavendra:
Hardness of Solving Sparse Overdetermined Linear Systems: A 3-Query PCP over Integers. 6:1-6:20 - Eli Ben-Sasson, Prahladh Harsha
, Oded Lachish
, Arie Matsliah:
Sound 3-Query PCPPs Are Long. 7:1-7:49
Volume 1, Number 3, March 2010
- Jan Kyncl
, Tomás Vyskocil:
Logspace Reduction of Directed Reachability for Bounded Genus Graphs to the Planar Case. 8:1-8:11 - Paul Beame
, Russell Impagliazzo
, Toniann Pitassi, Nathan Segerlind:
Formula Caching in DPLL. 9:1-9:33 - Samir Datta
, Raghav Kulkarni, Nutan Limaye, Meena Mahajan
:
Planarity, Determinants, Permanents, and (Unique) Matchings. 10:1-10:20
![](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.