Pages that link to "Item:Q4302809"
From MaRDI portal
The following pages link to Monotone circuits for matching require linear depth (Q4302809):
Displaying 26 items.
- Clique problem, cutting plane proofs and communication complexity (Q456115) (← links)
- Negation-limited circuit complexity of symmetric functions (Q671626) (← links)
- On the power of small-depth threshold circuits (Q685717) (← links)
- On the power of circuits with gates of low \(L_{1}\) norms. (Q1389652) (← links)
- Non-cancellative Boolean circuits: A generalization of monotone boolean circuits (Q1566723) (← links)
- An exponential gap with the removal of one negation gate (Q1603543) (← links)
- Toward the KRW composition conjecture: cubic formula lower bounds via communication complexity (Q1616616) (← links)
- The direct sum of universal relations (Q1751432) (← links)
- On the mystery of negations in circuits: structure vs power (Q2019505) (← links)
- Communication complexity of approximate Nash equilibria (Q2155907) (← links)
- Strengthening convex relaxations of 0/1-sets using Boolean formulas (Q2235155) (← links)
- On derandomized composition of Boolean functions (Q2281253) (← links)
- Prediction from partial information and hindsight, with application to circuit lower bounds (Q2311545) (← links)
- Random resolution refutations (Q2311546) (← links)
- The price of query rewriting in ontology-based data access (Q2453744) (← links)
- Lower bounds for Boolean circuits of bounded negation width (Q2672949) (← links)
- Toward Better Formula Lower Bounds: The Composition of a Function and a Universal Relation (Q2968148) (← links)
- Communication Lower Bounds via Critical Block Sensitivity (Q4554052) (← links)
- Randomized feasible interpolation and monotone circuits with a local oracle (Q4562441) (← links)
- Extension Complexity of Independent Set Polytopes (Q4606697) (← links)
- (Q4638079) (← links)
- Notes on Hazard-Free Circuits (Q4986809) (← links)
- Reflections on Proof Complexity and Counting Principles (Q5027248) (← links)
- Lower Bounds for DeMorgan Circuits of Bounded Negation Width (Q5090491) (← links)
- Natural proofs (Q5906823) (← links)
- New bounds for energy complexity of Boolean functions (Q5918995) (← links)
