Notes on Boolean read-\(k\) and multilinear circuits

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Lower bounds for monotone counting circuits
Multilinear formulas, maximal-partition discrepancy and mixed-sources extractors
Boolean function complexity. Advances and frontiers.
A Boolean function requiring 3n network size
A 4n-lower bound on the monotone network complexity of a one-output Boolean function
Complexity of tropical Schur polynomials
Lower bounds on monotone complexity of the logical permanent
The monotone circuit complexity of Boolean functions
Negation can be exponentially powerful
The complexity of partial derivatives
Colorings and orientations of graphs
Zwei lineare untere Schranken für die Komplexität Boolescher Funktionen
A lower bound on the number of additions in monotone computations
A direct version of Shamir and Snir's lower bounds on monotone circuit depth
Lower bounds on arithmetic circuits via partial derivatives
Non-cancellative Boolean circuits: A generalization of monotone boolean circuits
Tropical combinatorial Nullstellensatz and sparse polynomials
Norm-graphs and bipartite Turán numbers
On the incompressibility of monotone DNFs
Tropical complexity, Sidon sets, and dynamic programming
Partial derivatives in arithmetic complexity and beyond
Arithmetic Circuits: A survey of recent results and open questions
On the depth complexity of formulas
Some Exact Complexity Results for Straight-Line Computations over Semirings
On the Parallel Evaluation of Multivariate Polynomials
A method for deriving lower bounds for the complexity of monotone arithmetic circuits computing real polynomials
Explicit lower bound of 4.5n - o(n) for boolena circuits
Separating monotone VP and VNP
Approximation Limitations of Pure Dynamic Programming
FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
Multi-linear formulas for permanent and determinant are of super-polynomial size

This page was built for publication: Notes on Boolean read-\(k\) and multilinear circuits

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6648273)