Pages that link to "Item:Q5901079"
From MaRDI portal
The following pages link to Multi-linear formulas for permanent and determinant are of super-polynomial size (Q5901079):
Displayed 11 items.
- Optimal sparse matrix dense vector multiplication in the I/O-model (Q613122) (← links)
- Multilinear formulas, maximal-partition discrepancy and mixed-sources extractors (Q619913) (← links)
- Homogeneous formulas and symmetric polynomials (Q649096) (← links)
- Resolution over linear equations and multilinear proofs (Q952492) (← links)
- On \(\epsilon\)-sensitive monotone computations (Q2198153) (← links)
- Algebraic Complexity Classes (Q2821695) (← links)
- Lower Bounds for the Determinantal Complexity of Explicit Low Degree Polynomials (Q3392951) (← links)
- Simulation of Arithmetical Circuits by Branching Programs with Preservation of Constant Width and Syntactic Multilinearity (Q3392953) (← links)
- Arithmetic Circuits, Syntactic Multilinearity, and the Limitations of Skew Formulae (Q3599149) (← links)
- Non-commutative circuits and the sum-of-squares problem (Q5892594) (← links)
- Lower bounds for monotone \(q\)-multilinear Boolean circuits (Q6169535) (← links)