Pages that link to "Item:Q4978063"
From MaRDI portal
The following pages link to Strongly exponential lower bounds for monotone computation (Q4978063):
Displayed 14 items.
- Nullstellensatz size-degree trade-offs from reversible pebbling (Q2040600) (← links)
- Upslices, downslices, and secret-sharing with complexity of \(1.5^n\) (Q2129013) (← links)
- Quadratic secret sharing and conditional disclosure of secrets (Q2129018) (← links)
- Dag-like communication and its applications (Q2399382) (← links)
- Local bounds for the optimal information ratio of secret sharing schemes (Q2416938) (← links)
- Query-to-communication lifting for \(\mathsf{P}^{\mathsf{NP}}\) (Q2422767) (← links)
- Lower bounds for Boolean circuits of bounded negation width (Q2672949) (← links)
- Communication Lower Bounds via Critical Block Sensitivity (Q4554052) (← links)
- (Q5088887) (← links)
- Adventures in monotone complexity and TFNP (Q5090415) (← links)
- Lower Bounds for DeMorgan Circuits of Bounded Negation Width (Q5090491) (← links)
- Nullstellensatz size-degree trade-offs from reversible pebbling (Q5091769) (← links)
- Query-to-Communication Lifting Using Low-Discrepancy Gadgets (Q5856149) (← links)
- Monotone circuit lower bounds from robust sunflowers (Q5970784) (← links)