Pages that link to "Item:Q5402611"
From MaRDI portal
The following pages link to On the computational complexity of finding hard tautologies (Q5402611):
Displaying 5 items.
- Pseudo-finite hard instances for a student-teacher game with a Nisan-Wigderson generator (Q2904626) (← links)
- (Q4501542) (← links)
- Generating hard tautologies using predicate logic and the symmetric group (Q4521285) (← links)
- Logical Approaches to Computational Barriers (Q5898825) (← links)
- ON THE EXISTENCE OF STRONG PROOF COMPLEXITY GENERATORS (Q6204144) (← links)