Complexity Cores and Hard-To-Prove Formulas

Authors:
Uwe Schöning
Affiliations:
-
Venue:
CSL '87 Proceedings of the 1st Workshop on Computer Science Logic
Year:
1987

Citing 0
Cited 1

Nondeterministic Instance Complexity and Hard-to-Prove Tautologies

STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract