Symmetric arithmetic circuits
From MaRDI portal
Cites work
- A Selection of Lower Bounds for Arithmetic Circuits
- An optimal lower bound on the number of variables for graph identification
- Arithmetic circuits: a survey of recent results and open questions
- Definability by constant-depth polynomial-size circuits
- Definability of semidefinite programming and Lasserre lower bounds for CSPs
- Depth-3 arithmetic circuits over fields of characteristic zero
- Functional lower bounds for arithmetic circuits and connections to boolean circuit complexity
- scientific article; zbMATH DE number 1086678 (Why is no real title available?)
- scientific article; zbMATH DE number 1775446 (Why is no real title available?)
- On polynomial time computation over unordered structures
- On symmetric circuits and fixed-point logics
- On the power of symmetric linear programs
- On Weisfeiler-Leman invariance: subgraph counts and related graph properties
- Permanent v. determinant: an exponential lower bound assuming symmetry
- Recursive construction for 3-regular expanders
- Solving linear programs without breaking abstractions
- Some Exact Complexity Results for Straight-Line Computations over Semirings
- Symmetric circuits for rank logic
- The complexity of partial derivatives
- The Power of Counting Logics on Restricted Classes of Finite Structures
Cited in
(4)
This page was built for publication: Symmetric arithmetic circuits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6842540)
