The following pages link to On the virtue of succinct proofs (Q5415478):
Displaying 17 items.
- Large clique is hard on average for resolution (Q2117104) (← links)
- Simulation theorems via pseudo-random properties (Q2281252) (← links)
- Resolution over linear equations modulo two (Q2334112) (← links)
- Dag-like communication and its applications (Q2399382) (← links)
- Computing (and Life) Is All about Tradeoffs (Q2848971) (← links)
- Space Complexity in Polynomial Calculus (Q2944568) (← links)
- Communication Lower Bounds via Critical Block Sensitivity (Q4554052) (← links)
- Deterministic Communication vs. Partition Number (Q4562279) (← links)
- Extension Complexity of Independent Set Polytopes (Q4606697) (← links)
- Cumulative Space in Black-White Pebbling and Resolution (Q4638091) (← links)
- (Q4989407) (← links)
- (Q4993273) (← links)
- Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria (Q5020727) (← links)
- Adventures in monotone complexity and TFNP (Q5090415) (← links)
- (Q5140848) (← links)
- Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria (Q6139831) (← links)
- Space characterizations of complexity measures and size-space trade-offs in propositional proof systems (Q6168323) (← links)