On Complete Problems for NP$\cap$CoNP

Authors:
Juris Hartmanis;Neil Immerman
Affiliations:
-;-
Venue:
Proceedings of the 12th Colloquium on Automata, Languages and Programming
Year:
1985

Citing 0
Cited 4

On an optimal propositional proof system and the structure of easy subsets of TAUT

Theoretical Computer Science - Complexity and logic
Competing provers yield improved Karp-Lipton collapse results

Information and Computation
Generic oracles and oracle classes

SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Competing provers yield improved Karp-Lipton collapse results

Information and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract