The following pages link to (Q4035300):
Displaying 7 items.
- \(\text{Count}(q)\) does not imply \(\text{Count}(p)\) (Q1377601) (← links)
- Deterministic summation modulo \(\mathcal B_{n}\), the semigroup of binary relations on \(0,1, \dots, n-1\) (Q1392020) (← links)
- Cutting planes, connectivity, and threshold logic (Q1908818) (← links)
- An exponential separation between the parity principle and the pigeonhole principle (Q1923563) (← links)
- Propositional proof systems based on maximum satisfiability (Q2238728) (← links)
- A reduction of proof complexity to computational complexity for 𝐴𝐶⁰[𝑝] Frege systems (Q2944868) (← links)
- (Q4989407) (← links)