| Publication | Date of Publication | Type |
|---|
Finding a hidden code by asking questions
Lecture Notes in Computer Science | 2024-01-29 | Paper |
scientific article; zbMATH DE number 7015119 (Why is no real title available?)
| 2019-02-07 | Paper |
Fixed-Parameter Extrapolation and Aperiodic Order
| 2012-12-12 | Paper |
Computability and complexity theory.
Texts in Computer Science | 2011-10-18 | Paper |
Non-uniform reductions
Theory of Computing Systems | 2010-10-06 | Paper |
Nonuniform lower bounds for exponential time classes
Lecture Notes in Computer Science | 2010-06-17 | Paper |
Fundamentals of Computation Theory
Lecture Notes in Computer Science | 2006-10-20 | Paper |
Hyper-polynomial hierarchies and the polynomial jump
Theoretical Computer Science | 2002-03-03 | Paper |
Computability and complexity theory
Texts in Computer Science | 2001-02-19 | 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 1332676 (Why is no real title available?)
Chicago Journal of Theoretical Computer Science | 1999-09-08 | Paper |
scientific article; zbMATH DE number 1318518 (Why is no real title available?)
| 1999-08-08 | Paper |
Learning counting functions with queries
Theoretical Computer Science | 1998-07-22 | Paper |
Oracles That Compute Values
SIAM Journal on Computing | 1998-02-10 | Paper |
scientific article; zbMATH DE number 1072532 (Why is no real title available?)
| 1997-10-08 | Paper |
Scalability and the isomorphism problem
Information Processing Letters | 1997-02-27 | Paper |
scientific article; zbMATH DE number 956847 (Why is no real title available?)
| 1996-12-11 | Paper |
The bounded injury priority method and the learnability of unions of rectangles
Annals of Pure and Applied Logic | 1996-10-13 | Paper |
On reductions of NP sets to sparse sets
Journal of Computer and System Sciences | 1995-02-13 | Paper |
Immunity of complete problems
Information and Computation | 1995-01-12 | Paper |
Minimal pairs and complete problems
Theoretical Computer Science | 1994-09-25 | Paper |
On 1-truth-table-hard languages
Theoretical Computer Science | 1993-10-03 | Paper |
Almost-everywhere complexity hierarchies for nondeterministic time
Theoretical Computer Science | 1993-09-16 | Paper |
Oracles for structural properties: The isomorphism problem and public-key cryptography
Journal of Computer and System Sciences | 1992-09-27 | Paper |
Doubly-periodic sequences and a class of two-dimensional cyclic codes
Advances in Applied Mathematics | 1992-09-26 | Paper |
Completeness for nondeterministic complexity classes
Mathematical Systems Theory | 1992-06-26 | Paper |
scientific article; zbMATH DE number 18526 (Why is no real title available?)
| 1992-06-26 | Paper |
scientific article; zbMATH DE number 4154424 (Why is no real title available?)
| 1990-01-01 | Paper |
scientific article; zbMATH DE number 4205978 (Why is no real title available?)
| 1990-01-01 | Paper |
scientific article; zbMATH DE number 4189714 (Why is no real title available?)
| 1990-01-01 | Paper |
Absolute results concerning one-way functions and their applications
Mathematical Systems Theory | 1989-01-01 | Paper |
Minimal degrees for polynomial reducibilities
Journal of the ACM | 1987-01-01 | Paper |
Honest polynomial degrees and \(P=?NP\)
Theoretical Computer Science | 1987-01-01 | Paper |
On simple and creative sets in NP
Theoretical Computer Science | 1986-01-01 | Paper |
scientific article; zbMATH DE number 4014026 (Why is no real title available?)
| 1986-01-01 | Paper |
scientific article; zbMATH DE number 3981158 (Why is no real title available?)
| 1986-01-01 | Paper |
Doubly-Periodic Sequences and Two-Dimensional Recurrences
SIAM Journal on Algebraic Discrete Methods | 1985-01-01 | Paper |
scientific article; zbMATH DE number 3930984 (Why is no real title available?)
| 1985-01-01 | Paper |
Relativizations comparing NP and exponential time
Information and Control | 1983-01-01 | Paper |
Oracle-dependent properties of the lattice of NP sets
Theoretical Computer Science | 1983-01-01 | Paper |
Intermediate β-r.e. degrees and the half-jump
Journal of Symbolic Logic | 1983-01-01 | Paper |
Quadratic automata
Journal of Computer and System Sciences | 1982-01-01 | Paper |
Degrees of Non α‐Speedable Sets
Mathematical Logic Quarterly | 1981-01-01 | Paper |
Two splitting theorems for beta-recursion theory
Annals of Mathematical Logic | 1980-01-01 | Paper |
