Pages that link to "Item:Q2941756"
From MaRDI portal
The following pages link to Logical strength of complexity theory and a formalization of the PCP theorem in bounded arithmetic (Q2941756):
Displaying 8 items.
- Feasibly constructive proofs of succinct weak circuit lower bounds (Q2007873) (← links)
- Expander construction in \(\mathrm{VNC}^1\) (Q2187260) (← links)
- Unprovability of circuit upper bounds in Cook's theory PV (Q2980966) (← links)
- (Q3678664) (← links)
- Expander Construction in VNC1 (Q4638081) (← links)
- Comparing Constructive Arithmetical Theories Based on NP-PIND and coNP-PIND (Q4812318) (← links)
- Approximate counting and NP search problems (Q5055313) (← links)
- Proof complexity and beyond. Abstracts from the workshop held March 24--29, 2024 (Q6613418) (← links)