| Publication | Date of Publication | Type |
|---|
The complexity of poset games
Journal of Graph Algorithms and Applications | 2022-06-28 | Paper |
The complexity of regex crosswords
Information and Computation | 2022-06-13 | Paper |
Bipartite perfect matching is in quasi-NC
SIAM Journal on Computing | 2021-06-29 | Paper |
Complexity of regex crosswords
| 2019-12-04 | Paper |
scientific article; zbMATH DE number 7075886 (Why is no real title available?)
| 2019-07-03 | Paper |
Weakly useful sequences
Automata, Languages and Programming | 2019-01-10 | Paper |
Results on resource-bounded measure
Automata, Languages and Programming | 2018-07-04 | Paper |
Beyond \(\mathbf{P}^{\mathbf{NP}}=\mathbf{NEXP}\)
STACS 95 | 2017-12-04 | Paper |
Bipartite perfect matching is in quasi-NC
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2017-09-29 | Paper |
Game values and computational complexity: an analysis via black-white combinatorial games
Algorithms and Computation | 2016-01-11 | Paper |
Quantum algorithms for a set of group theoretic problems
International Journal of Foundations of Computer Science | 2015-07-06 | Paper |
On the complexity of the hidden subgroup problem
International Journal of Foundations of Computer Science | 2014-07-04 | Paper |
Functions that preserve p-randomness
Information and Computation | 2014-01-16 | Paper |
Fixed-Parameter Extrapolation and Aperiodic Order
| 2012-12-12 | Paper |
Monochromatic boxes in colored grids
SIAM Journal on Discrete Mathematics | 2012-03-15 | Paper |
A Statement in Combinatorics that is Independent of ZFC (an exposition)
| 2012-01-05 | Paper |
Functions that preserve p-randomness
Lecture Notes in Computer Science | 2011-08-19 | Paper |
Rectangle Free Coloring of Grids
| 2010-05-20 | Paper |
The complexity of learning SUBSEQ(A)
Journal of Symbolic Logic | 2009-09-29 | Paper |
scientific article; zbMATH DE number 5604074 (Why is no real title available?)
| 2009-09-15 | Paper |
The complexity of finding SUBSEQ\((A)\)
Theory of Computing Systems | 2009-09-02 | Paper |
Efficient Universal Quantum Circuits
Lecture Notes in Computer Science | 2009-07-23 | Paper |
The Complexity of Learning SUBSEQ (A)
Lecture Notes in Computer Science | 2008-09-04 | Paper |
On the Complexity of the Hidden Subgroup Problem
Lecture Notes in Computer Science | 2008-05-27 | Paper |
Theoretical Computer Science
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Fundamentals of Computation Theory
Lecture Notes in Computer Science | 2006-10-20 | Paper |
Every polynomial-time 1-degree collapses if and only if P = PSPACE
Journal of Symbolic Logic | 2005-08-29 | Paper |
scientific article; zbMATH DE number 2156270 (Why is no real title available?)
| 2005-04-15 | Paper |
Inverting onto functions.
Information and Computation | 2004-03-14 | Paper |
PP-lowness and a simple definition of AWPP
Theory of Computing Systems | 2003-08-26 | Paper |
An oracle builder's toolkit
Information and Computation | 2003-07-29 | Paper |
scientific article; zbMATH DE number 1796836 (Why is no real title available?)
| 2002-09-08 | Paper |
Two oracles that force a big crunch
Computational Complexity | 2002-05-05 | Paper |
Hyper-polynomial hierarchies and the polynomial jump
Theoretical Computer Science | 2002-03-03 | Paper |
scientific article; zbMATH DE number 1256638 (Why is no real title available?)
| 2002-01-17 | Paper |
Determining acceptance possibility for a quantum computation is hard for the polynomial hierarchy
Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences | 2000-03-22 | Paper |
scientific article; zbMATH DE number 1398071 (Why is no real title available?)
| 2000-02-03 | Paper |
Bounded Immunity and Btt-Reductions
Mathematical Logic Quarterly | 1999-09-21 | Paper |
scientific article; zbMATH DE number 1332676 (Why is no real title available?)
Chicago Journal of Theoretical Computer Science | 1999-09-08 | Paper |
Oracles That Compute Values
SIAM Journal on Computing | 1998-02-10 | Paper |
Gap-definability as a closure property
Information and Computation | 1997-11-18 | Paper |
The Isomorphism Conjecture Holds Relative to an Oracle
SIAM Journal on Computing | 1996-04-24 | Paper |
Almost weakly 2-generic sets
Journal of Symbolic Logic | 1996-01-21 | Paper |
scientific article; zbMATH DE number 512854 (Why is no real title available?)
| 1995-10-09 | Paper |
Gap-definable counting classes
Journal of Computer and System Sciences | 1994-12-11 | Paper |
scientific article; zbMATH DE number 512846 (Why is no real title available?)
| 1994-03-10 | Paper |
