Pages that link to "Item:Q3507523"
From MaRDI portal
The following pages link to Lower Bounds for Lovász–Schrijver Systems and Beyond Follow from Multiparty Communication Complexity (Q3507523):
Displayed 19 items.
- Towards NP-P via proof complexity and search (Q408544) (← links)
- The NOF multiparty communication complexity of composed functions (Q496305) (← links)
- One-way multiparty communication lower bound for pointer jumping with applications (Q532058) (← links)
- Tight size-degree bounds for sums-of-squares proofs (Q1686838) (← links)
- Rank complexity gap for Lovász-Schrijver and Sherali-Adams proof systems (Q1947040) (← links)
- Resolution over linear equations modulo two (Q2334112) (← links)
- Dag-like communication and its applications (Q2399382) (← links)
- The Multiparty Communication Complexity of Set Disjointness (Q2817790) (← links)
- On the Non-deterministic Communication Complexity of Regular Languages (Q3533002) (← links)
- ON THE NON-DETERMINISTIC COMMUNICATION COMPLEXITY OF REGULAR LANGUAGES (Q3586400) (← links)
- Communication Lower Bounds via Critical Block Sensitivity (Q4554052) (← links)
- (Q4612487) (← links)
- (Q5005112) (← links)
- Reflections on Proof Complexity and Counting Principles (Q5027248) (← links)
- Larger Corner-Free Sets from Better NOF Exactly-$N$ Protocols (Q5028500) (← links)
- Adventures in monotone complexity and TFNP (Q5090415) (← links)
- (Q5090432) (← links)
- (Q5140848) (← links)
- Narrow Proofs May Be Maximally Long (Q5277920) (← links)