Functions with bounded symmetric communication complexity, programs over commutative monoids, and ACC
From MaRDI portal
Publication:1317485
DOI10.1016/0022-0000(93)90039-YzbMath0795.68107MaRDI QIDQ1317485
Publication date: 11 September 1994
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (2)
On random orderings of variables for parity ordered binary decision diagrams ⋮ A Lifting Theorem with Applications to Symmetric Functions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- \(NC^ 1\): The automata-theoretic viewpoint
- Non-uniform automata over groups
- \(\Sigma_ 1^ 1\)-formulae on finite structures
- Lower bounds on the size of bounded depth circuits over a complete basis with logical addition
- Lower bounds for synchronous circuits and planar circuits
- Linear-size constant-depth polylog-threshold circuits
- Extensions to Barrington's M-program model
- Parity, circuits, and the polynomial-time hierarchy
- Lower Bounds on Synchronous Combinational Complexity
This page was built for publication: Functions with bounded symmetric communication complexity, programs over commutative monoids, and ACC
