Pages that link to "Item:Q2944908"
From MaRDI portal
The following pages link to Collapsing modular counting in bounded arithmetic and constant depth propositional proofs (Q2944908):
Displaying 17 items.
- Partial collapses of the \(\Sigma _1\) complexity hierarchy in models for fragments of bounded arithmetic (Q866557) (← links)
- Proof complexity in algebraic systems and bounded depth Frege systems with modular counting (Q1377580) (← links)
- Feasibly constructive proofs of succinct weak circuit lower bounds (Q2007873) (← links)
- Expander construction in \(\mathrm{VNC}^1\) (Q2187260) (← links)
- Induction rules in bounded arithmetic (Q2309507) (← links)
- Random resolution refutations (Q2311546) (← links)
- Resolution over linear equations modulo two (Q2334112) (← links)
- Uniform proofs of ACC representations (Q2402964) (← links)
- Contribution of Warsaw logicians to computational logic (Q2422533) (← links)
- A reduction of proof complexity to computational complexity for 𝐴𝐶⁰[𝑝] Frege systems (Q2944868) (← links)
- (Q3001100) (← links)
- Approximate counting by hashing in bounded arithmetic (Q3399180) (← links)
- Randomized feasible interpolation and monotone circuits with a local oracle (Q4562441) (← links)
- Expander Construction in VNC1 (Q4638081) (← links)
- Approximate counting and NP search problems (Q5055313) (← links)
- Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 12--17, 2023 (Q6613397) (← links)
- First-order reasoning and efficient semi-algebraic proofs (Q6614038) (← links)
