Representable Disjoint NP-Pairs
We investigate the class of disjoint NP-pairs under different reductions. The structure of this class is intimately linked to the simulation order of propositional proof systems, and we make use of the relationship between propositional proof systems and theories of bounded arithmetic as the main tool of our analysis. Specifically we exhibit a pair which is complete under strong reductions for all disjoint NP-pairs representable in a theory. We use these pairs to explain the simulation order of NP-pairs under these reductions. As corollaries we also get simplified proofs of results obtained earlier in  and .
KeywordsPolynomial Time Proof System Propositional Variable Propositional Formula Boolean Circuit
Unable to display preview. Download preview PDF.
- 2.Glaßer, C., Selman, A., Sengupta, S., Zhang, L.: Disjoint NP-pairs. In: Proceedings 18th Annual IEEE Conference on Computational Complexity, pp. 313–332 (2003)Google Scholar
- 3.Glaßer, C., Selman, A., Sengupta, S.: Reductions between disjoint NP-pairs. In: Proceedings 19th Annual IEEE Conference on Computational Complexity (2004)Google Scholar
- 6.Krajíček, J.: Bounded Arithmetic, Propositional Logic, and Complexity Theory. In: Encyclopedia of Mathematics and Its Applications, vol. 60. Cambridge University Press, Cambridge (1995)Google Scholar
- 12.Razborov, A.A.: On provably disjoint NP-pairs. Technical Report TR94-006, Electronic Colloquium on Computational Complexity (1994)Google Scholar