Sparse hard sets for P: resolution of a conjecture of Hartmanis

Authors:
Jin-Yi Cai;D. Sivakumar
Affiliations:
-;-
Venue:
Journal of Computer and System Sciences - Special issue on the 36th IEEE symposium on the foundations of computer science
Year:
1999

Introduction

ACM SIGACT News
Separating NE from Some Nonuniform Nondeterministic Complexity Classes

COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
On the computational complexity of the languages of general symbolic dynamical systems and beta-shifts

Theoretical Computer Science
Randomness and completeness in computational complexity

Randomness and completeness in computational complexity
Reducibility and completeness

Algorithms and theory of computation handbook
Separating NE from some nonuniform nondeterministic complexity classes

Journal of Combinatorial Optimization
Pure pointer programs and tree isomorphism

FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures

Hi-index	0.00