Pages that link to "Item:Q5422312"
From MaRDI portal
The following pages link to Approximate counting in bounded arithmetic (Q5422312):
Displaying 14 items.
- Circuit lower bounds in bounded arithmetics (Q466447) (← links)
- Feasibly constructive proofs of succinct weak circuit lower bounds (Q2007873) (← links)
- On measure quantifiers in first-order arithmetic (Q2117748) (← links)
- Expander construction in \(\mathrm{VNC}^1\) (Q2187260) (← links)
- Polynomial time ultrapowers and the consistency of circuit lower bounds (Q2288334) (← links)
- Uniform proofs of ACC representations (Q2402964) (← links)
- Typical forcings, NP search problems and an extension of a theorem of Riis (Q2659102) (← links)
- Collapsing modular counting in bounded arithmetic and constant depth propositional proofs (Q2944908) (← links)
- Unprovability of circuit upper bounds in Cook's theory PV (Q2980966) (← links)
- A Tight Karp-Lipton Collapse Result in Bounded Arithmetic (Q3540180) (← links)
- Expander Construction in VNC1 (Q4638081) (← links)
- Approximate counting and NP search problems (Q5055313) (← links)
- On counting propositional logic and Wagner's hierarchy (Q6100184) (← links)
- ON THE EXISTENCE OF STRONG PROOF COMPLEXITY GENERATORS (Q6204144) (← links)
