On polynomial time bounded truth-table reducibility of NP sets to sparse sets

Authors:
M. Ogiwara;O. Watanabe
Affiliations:
Department of Information Sciences, Tokyo Institute of Technology, Ookayama, Tokyo 152 Japan;Department of Information Sciences, Tokyo Institute of Technology, Ookayama, Tokyo 152 Japan
Venue:
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Year:
1990

Complexity and structure

Complexity and structure
Structural complexity 1

Structural complexity 1
On sets truth-table reducible to sparse sets

SIAM Journal on Computing
On

ICALP '88 Proceedings of the 15th International Colloquium on Automata, Languages and Programming
Some connections between nonuniform and uniform complexity classes

STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION

DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION

Hi-index	0.00