Information and Computation
Complexity classes without machines: on complete languages for UP
Theoretical Computer Science - Thirteenth International Colloquim on Automata, Languages and Programming, Renne
The method of forced enumeration for nondeterministic automata
Acta Informatica
Nondeterministic space is closed under complementation
SIAM Journal on Computing
A note on almost-everywhere-complex sets and separating deterministic-time-complexity classes
Information and Computation
Separating complexity classes with tally oracles
Theoretical Computer Science
Algebraic methods for interactive proof systems
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Almost-everywhere complexity hierarchies for nondeterministic time
Theoretical Computer Science
Upward separation for FewP and related classes
Information Processing Letters
Defying upward and downward separation
Information and Computation
Probabilistic checking of proofs: a new characterization of NP
Journal of the ACM (JACM)
Two-Tape Simulation of Multitape Turing Machines
Journal of the ACM (JACM)
Separating Nondeterministic Time Complexity Classes
Journal of the ACM (JACM)
On Relativization and the Existence of Complete Sets
Proceedings of the 9th Colloquium on Automata, Languages and Programming
A Probabilistic-Time Hierarchy Theorem for "Slightly Non-uniform" Algorithms
RANDOM '02 Proceedings of the 6th International Workshop on Randomization and Approximation Techniques
A hierarchy for nondeterministic time complexity
STOC '72 Proceedings of the fourth annual ACM symposium on Theory of computing
Hierarchy Theorems for Probabilistic Polynomial Time
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Hierarchies for semantic classes
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
A Generic Time Hierarchy for Semantic Models with One Bit of Advice
CCC '06 Proceedings of the 21st Annual IEEE Conference on Computational Complexity
| Hi-index | 0.00 |
For those who are big fans of the fantastic complexity textbook by Daniel Bovet and Pierluigi Crescenzi [BC93] (and I myself certainly am), there is great news. The authors have made their book available online, free of charge for noncommercial use. It can be found at via Pilu's web site (start at http://www.algoritmica.org/piluc, then click on the "Books" section, and then click on "Introduction to the Theory of Complexity").