The following pages link to (Q4375799):
Displaying 14 items.
- Mean-payoff games and propositional proofs (Q716324) (← links)
- Nondeterministic functions and the existence of optimal proof systems (Q837177) (← links)
- No feasible monotone interpolation for simple combinatorial reasoning (Q1575265) (← links)
- From private simultaneous messages to zero-information Arthur-Merlin protocols and back (Q1698392) (← links)
- On the automatizability of resolution and related propositional proof systems (Q1881219) (← links)
- On the automatizability of polynomial calculus (Q1959382) (← links)
- On arithmetic branching programs (Q1961372) (← links)
- Nullstellensatz size-degree trade-offs from reversible pebbling (Q2040600) (← links)
- A framework for space complexity in algebraic proof systems (Q2796410) (← links)
- (Q3819996) (← links)
- Adventures in monotone complexity and TFNP (Q5090415) (← links)
- Nullstellensatz size-degree trade-offs from reversible pebbling (Q5091769) (← links)
- Proof Complexity of Non-classical Logics (Q5894972) (← links)
- On the computational content of intuitionistic propositional proofs (Q5940143) (← links)