Symmetry and complexity

Authors:
László Babai;Robert Beals;Pál Takácsi-Nagy
Affiliations:
Department of Computer Science, University of Chicago, Chicago, Illinois and Eötvös University, Budapest, Hungary H-1088;Department of Computer Science, University of Chicago, Chicago, Illinois;Department of Computer Science, University of Chicago, Chicago, Illinois
Venue:
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Year:
1992

Bounded-depth, polynomial-size circuits for symmetric functions

Theoretical Computer Science
Permutation groups in NC

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
The complexity of Boolean functions

The complexity of Boolean functions
Boolean functions, invariance groups, and parallel complexity

SIAM Journal on Computing
Permutation groups without exponentially many orbits on the power set

Journal of Combinatorial Theory Series A
Fast parallel computation with permutation groups

SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science

Hypergraph isomorphism and structural equivalence of Boolean functions

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing

Hi-index	0.00