Computational Theory and Mathematics

Filters3 filters applied

Year

Readable here

At least an abstract

13 papersQuestions on this topic

2 filters appliedReadable here: At least an abstract Year: Before 2000 Clear all

Unambiguous Computation: Boolean Hierarchies and Sparse Turing-Complete Sets
Lane A. Hemaspaandra, Joerg Rothe · SIAM Journal on Computing vol. 26, no. 3, pp. 634--653, 1997 · 1999
Abstract onlyNot checked
Translating Equality Downwards
Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel · 1999
Abstract onlyNot checked
Two-way finite automata with quantum and classical states
Andris Ambainis, John Watrous · 1999
Abstract onlyNot checked
PSPACE has 2-round quantum interactive proof systems
John Watrous · 1999
Abstract onlyNot checked
An Introduction to Query Order
Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel · Bulletin of the EATCS, 63, 93-107, 1997 · 1999
Abstract onlyNot checked
Raising NP Lower Bounds to Parallel NP Lower Bounds
Edith Hemaspaandra, Lane A. Hemaspaandra, Joerg Rothe · SIGACT News vol. 28, no. 2, pp. 2--13, 1997 · 1999
Abstract onlyNot checked
Average-Case Complexity of Shellsort
Tao Jiang, Ming Li, Paul Vitanyi · 1999
Abstract onlyNot checked
Reasoning About Common Knowledge with Infinitely Many Agents
Joseph Y. Halpern, Richard A. Shore · 1999
Abstract onlyNot checked
Mutual Search
Harry Buhrman, Matthew Franklin, Juan A. Garay et al. · 1999
Abstract onlyNot checked
Query Order and the Polynomial Hierarchy
Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel · Journal of Universal Computer Science, 4, 574-588, 1998 · 1999
Abstract onlyNot checked
On the Power of Positive Turing Reductions
Edith Hemaspaandra · 1999
Abstract onlyNot checked
Formulas as Programs
Krzysztof R. Apt, Marc Bezem · 1998
Abstract onlyNot checked
A Generalized Quantifier Concept in Computational Complexity Theory
Heribert Vollmer · 1998
Abstract onlyNot checked