Reductions between disjoint NP-Pairs-Reference-Cited by-同舟云学术

Reductions between disjoint NP-Pairs

Published:2005-08 Issue:2 Volume:200 Page:247-267
ISSN:0890-5401
Container-title:Information and Computation
language:en
Short-container-title:Information and Computation

Author:

Glaßer Christian,Selman Alan L.,Sengupta Samik

Funder

Deutscher Akademischer Austauschdienst

National Science Foundation

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science

Reference27 articles.

1. Quantitative relativizations of complexity classes;Book;SIAM Journal on Computing,1984

2. Tally languages and complexity classes;Book;Information and Control,1974

3. A uniform approach to define complexity classes;Bovet;Theoretical Computer Science,1992

4. The complexity of promise problems with applications to public-key cryptography;Even;Information and Control,1984

5. S. Fenner, F. Green, S. Homer, A. Selman, T. Thierauf, H. Vollmer, Complements of multivalued functions, Chicago Journal of Theoretical Computer Science (1999), article 3 of volume 1999.

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

1. A Scale Conversion Model Based on Deep Learning of UAV Images;Remote Sensing;2023-05-06

2. Dimension and the Structure of Complexity Classes;Theory of Computing Systems;2022-08-17

3. NP-Completeness, Proof Systems, and Disjoint NP-Pairs;LEIBNIZ INT PR INFOR;2020

4. Disjoint NP-Pairs and Propositional Proof Systems;ACM SIGACT News;2014-12-09

5. Unions of Disjoint NP-Complete Sets;ACM Transactions on Computation Theory;2014-03