Functions with bounded symmetric communication complexity, programs over commutative monoids, and ACC
type: Item
instance of: scholarly article
title: Functions with bounded symmetric communication complexity, programs over commutative monoids, and ACC
zbMATH Open document ID: 0795.68107
DOI: 10.1016/0022-0000(93)90039-Y
published in: Journal of Computer and System Sciences
publication date: 1994-09-11T00:00:00Z
Mathematics Subject Classification ID: 68Q30
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 94C10
Mathematics Subject Classification ID: 20M35
zbMATH DE Number: 529948
zbMATH Keywords: functions with bounded symmetric communication complexity
zbMATH Keywords: programs over commutative monoids
MaRDI profile type: Publication
cites work: \(\Sigma_ 1^ 1\)-formulae on finite structures
cites work: Non-uniform automata over groups
cites work: Extensions to Barrington's M-program model
cites work: Parity, circuits, and the polynomial-time hierarchy
cites work: Lower Bounds on Synchronous Combinational Complexity
cites work: Q5203681
cites work: \(NC^ 1\): The automata-theoretic viewpoint
cites work: Linear-size constant-depth polylog-threshold circuits
cites work: Lower bounds on the size of bounded depth circuits over a complete basis with logical addition
cites work: Lower bounds for synchronous circuits and planar circuits
cites work: Q3352964
cites work: Q4094791
cites work: Q4266529
cites work: Q3221885
author: Mario Szegedy
description: scientific article; zbMATH DE number 529948