Pages that link to "Item:Q1094870"
From MaRDI portal
The following pages link to The monotone circuit complexity of Boolean functions (Q1094870):
Displaying 41 items.
- Dag-like communication and its applications (Q2399382) (← links)
- Sunflowers and testing triangle-freeness of functions (Q2410684) (← links)
- Bounds in ontology-based data access via circuit complexity (Q2411040) (← links)
- Finding a smallest odd hole in a claw-free graph using global structure (Q2444540) (← links)
- The price of query rewriting in ontology-based data access (Q2453744) (← links)
- Applications of matrix methods to the theory of lower bounds in computational complexity (Q2638784) (← links)
- Lower bounds for Boolean circuits of bounded negation width (Q2672949) (← links)
- Acyclicity programming for sigma-protocols (Q2695643) (← links)
- $$P\mathop{ =}\limits^{?}NP$$ (Q2826803) (← links)
- A feasible interpolation for random resolution (Q2980967) (← links)
- Towards an Almost Quadratic Lower Bound on the Monotone Circuit Complexity of the Boolean Convolution (Q2988838) (← links)
- Secret Sharing for mNP: Completeness Results (Q3179496) (← links)
- Nonuniform ACC Circuit Lower Bounds (Q3189637) (← links)
- Circuit Complexity Meets Ontology-Based Data Access (Q3194705) (← links)
- Feasible Interpolation for QBF Resolution Calculi (Q3448783) (← links)
- On Negations in Boolean Networks (Q3644711) (← links)
- Discretely ordered modules as a first-order extension of the cutting planes proof system (Q4254700) (← links)
- Interpolation theorems, lower bounds for proof systems, and independence results for bounded arithmetic (Q4358049) (← links)
- Lower bounds for cutting planes proofs with small coefficients (Q4372903) (← links)
- Lower bounds for resolution and cutting plane proofs and monotone computations (Q4372917) (← links)
- If the Current Clique Algorithms Are Optimal, so Is Valiant's Parser (Q4562283) (← links)
- Randomized feasible interpolation and monotone circuits with a local oracle (Q4562441) (← links)
- (Q4612482) (← links)
- A Fixed-Depth Size-Hierarchy Theorem for $\mathrm{AC}^0[\oplus]$ via the Coin Problem (Q4957916) (← links)
- Notes on Hazard-Free Circuits (Q4986809) (← links)
- A recursion-theoretic characterisation of the positive polynomial-time functions (Q5079742) (← links)
- Lower Bounds for DeMorgan Circuits of Bounded Negation Width (Q5090491) (← links)
- On the Symmetries of and Equivalence Test for Design Polynomials. (Q5092415) (← links)
- A super-quadratic lower bound for depth four arithmetic circuits (Q5092474) (← links)
- (Q5121914) (← links)
- (Q5121915) (← links)
- (Q5140848) (← links)
- The Average-Case Complexity of Counting Cliques in Erdös--Rényi Hypergraphs (Q5157395) (← links)
- Approximation Limitations of Pure Dynamic Programming (Q5216795) (← links)
- Positive Neural Networks in Discrete Time Implement Monotone-Regular Behaviors (Q5380357) (← links)
- An exponential lower bound for a constraint propagation proof system based on ordered binary decision diagrams (Q5387310) (← links)
- Lower bounds for modal logics (Q5422311) (← links)
- Proof Complexity of Non-classical Logics (Q5894972) (← links)
- Natural proofs (Q5906823) (← links)
- Monotone circuit lower bounds from robust sunflowers (Q5970784) (← links)
- Shadows of Newton polytopes (Q6076195) (← links)
