Pages that link to "Item:Q2796410"
From MaRDI portal
The following pages link to A framework for space complexity in algebraic proof systems (Q2796410):
Displaying 12 items.
- Efficient rational proofs for space bounded computations (Q1675446) (← links)
- Space-efficient fragments of higher-order fixpoint logic (Q1685775) (← links)
- Space proof complexity for random 3-CNFs (Q2013560) (← links)
- Proof spaces for unbounded parallelism (Q2819827) (← links)
- Total space in resolution (Q2829448) (← links)
- Pseudo-partitions, transversality and locality (Q2986893) (← links)
- Computational Space Efficiency and Minimal Model Generation for Guarded Formulae (Q2996155) (← links)
- (Q4474211) (← links)
- Cumulative Space in Black-White Pebbling and Resolution (Q4638091) (← links)
- Resolution and the binary encoding of combinatorial principles (Q5091756) (← links)
- Narrow Proofs May Be Maximally Long (Q5277920) (← links)
- Proof complexity and the binary encoding of combinatorial principles (Q6562831) (← links)