Pages that link to "Item:Q1288204"
From MaRDI portal
The following pages link to An exponential lower bound for the size of monotone real circuits (Q1288204):
Displaying 19 items.
- Monotone real circuits are more powerful than monotone Boolean circuits (Q290209) (← links)
- Lower bounds for monotone real circuit depth and formula size and tree-like cutting planes (Q293309) (← links)
- Lifting lower bounds for tree-like proofs (Q475337) (← links)
- On the complexity of cutting-plane proofs using split cuts (Q969513) (← links)
- Lower bounds on monotone arithmetic circuits with restricted depths (Q1070999) (← links)
- On reducibility and symmetry of disjoint NP pairs. (Q1401249) (← links)
- On the bottleneck counting argument (Q1566741) (← links)
- A note on monotone real circuits (Q1685020) (← links)
- The gap between monotone and non-monotone circuit complexity is exponential (Q1813126) (← links)
- On the automatizability of resolution and related propositional proof systems (Q1881219) (← links)
- Dag-like communication and its applications (Q2399382) (← links)
- On the incompressibility of monotone DNFs (Q2642913) (← links)
- Strongly exponential lower bounds for monotone computation (Q4978063) (← links)
- Monotone circuit lower bounds from resolution (Q5140848) (← links)
- ON THE COMPLEXITY OF CIRCUITS IN BASES CONTAINING MONOTONE ELEMENTS WITH ZERO WEIGHTS (Q5150707) (← links)
- Random \( \Theta (\log n) \) -CNFs are Hard for Cutting Planes (Q5889793) (← links)
- Combinatorics of monotone computations (Q5928586) (← links)
- Monotone circuit lower bounds from robust sunflowers (Q5970784) (← links)
- Cutting planes width and the complexity of graph isomorphism refutations (Q6636618) (← links)
