Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDACM Transactions on Computation Theory, Volume 5
Volume 5, Number 1, May 2013
- Per Austrin, Johan Håstad
:
On the usefulness of predicates. 1:1-1:24 - Olaf Beyersdorff, Samir Datta, Andreas Krebs, Meena Mahajan, Gido Scharfenberger-Fabian, Karteek Sreenivasaiah, Michael Thomas, Heribert Vollmer:
Verifying proofs in constant depth. 2:1-2:23 - Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk:
On multiway cut parameterized above lower bounds. 3:1-3:11
Volume 5, Number 2, July 2013
- Matthias Englert, Heiko Röglin, Jacob Spönemann, Berthold Vöcking:
Economical Caching. 4:1-4:21 - Andrej Bogdanov, Akinori Kawachi, Hidetoki Tanaka:
Hard Functions for Low-Degree Polynomials over Prime Fields. 5:1-5:15 - Ryan Williams:
Alternation-Trading Proofs, Linear Programming, and Lower Bounds. 6:1-6:49 - Dana Ron, Gilad Tsur:
On Approximating the Number of Relevant Variables in a Function. 7:1-7:19
Volume 5, Number 3, August 2013
- Eric Allender, Shafi Goldwasser:
Introduction to the special issue on innovations in theoretical computer science 2012. 8:1 - Rasmus Pagh:
Compressed matrix multiplication. 9:1-9:17 - Michael Viderman:
Linear-time decoding of regular expander codes. 10:1-10:25 - Maris Ozols, Martin Roetteler, Jérémie Roland:
Quantum rejection sampling. 11:1-11:33 - Andrew Drucker:
High-confidence predictions under adversarial uncertainty. 12:1-12:18
Volume 5, Number 4, November 2013
- Arkadev Chattopadhyay, Jacobo Torán, Fabian Wagner:
Graph Isomorphism is Not AC0-Reducible to Group Isomorphism. 13:1-13:13 - Anindya De, Elchanan Mossel:
Explicit Optimal Hardness via Gaussian Stability Results. 14:1-14:26 - Víctor Dalmau, Andrei A. Krokhin:
Robust Satisfiability for CSPs: Hardness and Algorithmic Results. 15:1-15:25 - Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Elena Losievskaja, Frances A. Rosamond, Saket Saurabh:
Distortion is Fixed Parameter Tractable. 16:1-16:20 - Alexander A. Razborov, Emanuele Viola:
Real Advantage. 17:1-17:8 - Ryan C. Harkins, John M. Hitchcock:
Exact Learning Algorithms, Betting Games, and Circuit Lower Bounds. 18:1-18:11
a service of 
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-04-19 19:19 CEST 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:
