On polynomial-time truth-table reducibility of intractable sets to P-selective sets-Reference-Cited by-同舟云学术

On polynomial-time truth-table reducibility of intractable sets to P-selective sets

Published:1991-12 Issue:1 Volume:24 Page:69-82
ISSN:0025-5661
Container-title:Mathematical Systems Theory
language:en
Short-container-title:Math. Systems Theory

Author:

Toda Seinosuke

Publisher

Springer Science and Business Media LLC

Subject

Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science,Computational Theory and Mathematics,Theoretical Computer Science

Link

http://link.springer.com/content/pdf/10.1007/BF02090391.pdf

Reference40 articles.

1. L. Adleman, Two theorems on random polynomial time,Proc. 17th Ann. Symposium on Foundations of Computer Science (1978), pp. 75–83.

2. Lecture Notes in Computer Science;E. Allender,1986

3. A. Amir and W. I. Gasarch, Polynomial terse sets,Inform. and Computation 77 (1988), 37–56.

4. R. Beigel, A structural theorem that depends quantitatively on the complexity of SAT,Proc. 2nd Conference on Structure in Complexity Theory (1987), pp. 28–34.

5. R. Beigel, NP-hard sets are p-superterse unless R = NP, Technical Report 88-04, Department of Computer Science, The Johns Hopkins University (1988).

Cited by 44 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On the Advice Complexity of Tournaments;Lecture Notes in Computer Science;2012

2. Robustness of PSPACE-complete sets;Information Processing Letters;2007-07

3. Open questions in the theory of semifeasible computation;ACM SIGACT News;2006-03

4. Properties of NP‐Complete Sets;SIAM Journal on Computing;2006-01

5. The Complexity of Finding Top-Toda-Equivalence-Class Members;Theory of Computing Systems;2005-08-03