Pages that link to "Item:Q5892128"
From MaRDI portal
The following pages link to Hard Instances of Algorithms and Proof Systems (Q5892128):
Displaying 9 items.
- Hardness assumptions in the foundations of theoretical computer science (Q2388429) (← links)
- (Q3822152) (← links)
- (Q4251070) (← links)
- (Q4281686) (← links)
- (Q4501542) (← links)
- (Q4727431) (← links)
- A remark on pseudo proof systems and hard instances of the satisfiability problem (Q5109236) (← links)
- (Q5136303) (← links)
- Automating algebraic proof systems is NP-hard (Q6086995) (← links)