scientific article; zbMATH DE number 1929951
From MaRDI portal
Publication:4708583
Cited in
(35)- Negation-limited complexity of parity and inverters
- On the limits of gate elimination
- Local reduction
- Size-treewidth tradeoffs for circuits computing the element distinctness function
- Gate elimination: circuit size lower bounds and \#SAT upper bounds
- Small normalized circuits for semi-disjoint bilinear forms require logarithmic and-depth
- PAC-learning gains of Turing machines over circuits and neural networks
- Lower bound of circuit complexity of parity function in a basis of unbounded fan-in
- On the power of nondeterministic circuits and co-nondeterministic circuits
- New lower bounds on circuit size of multi-output functions
- A well-mixed function with circuit complexity \(5n\): tightness of the Lachish-Raz-type bounds
- Nonuniform ACC circuit lower bounds
- Correlation bounds and \#SAT algorithms for small linear-size circuits
- Lower bounds for the size of nondeterministic circuits
- Correlation bounds and \#SAT algorithms for small linear-size circuits
- A Well-Mixed Function with Circuit Complexity 5n ±o(n): Tightness of the Lachish-Raz-Type Bounds
- Lower bounds against weakly-uniform threshold circuits
- Hardness magnification near state-of-the-art lower bounds
- Hardness magnification near state-of-the-art lower bounds
- scientific article; zbMATH DE number 7561750 (Why is no real title available?)
- A super-quadratic lower bound for depth four arithmetic circuits
- scientific article; zbMATH DE number 7204282 (Why is no real title available?)
- scientific article; zbMATH DE number 7250166 (Why is no real title available?)
- Exploring the limits of subadditive approaches: parallels between optimization and complexity theory
- Explicit lower bound of 4.5n - o(n) for boolena circuits
- Is there an oblivious RAM lower bound for online reads?
- Is there an oblivious RAM lower bound for online reads?
- Improving \(3N\) circuit complexity lower bounds
- Proof complexity and beyond. Abstracts from the workshop held March 24--29, 2024
- Notes on Boolean read-k and multilinear circuits
- Negation-limited formulas
- Fooling near-maximal decision trees
- The complexity of depth-3 circuits computing symmetric Boolean functions
- Reductions for monotone Boolean circuits
- New upper bounds on the Boolean circuit complexity of symmetric functions
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4708583)
