A Direct Sum Theorem for Corruption and the Multiparty NOF Communication Complexity of Set Disjointness

Authors:
Paul Beame;Toniann Pitassi;Nathan Segerlind;Avi Wigderson
Affiliations:
University of Washington;University of Toronto;University of Washington;Institute for Advanced Study
Venue:
CCC '05 Proceedings of the 20th Annual IEEE Conference on Computational Complexity
Year:
2005

Citing 0
Cited 5

A Strong Direct Product Theorem for Corruption and the Multiparty Communication Complexity of Disjointness

Computational Complexity
Direct product theorems for classical communication complexity via subdistribution bounds: extended abstract

STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Lower bounds for lovász-schrijver systems and beyond follow from multiparty communication complexity

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
NOF-multiparty information complexity bounds for pointer jumping

MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Choosing, Agreeing, and Eliminating in Communication Complexity

Computational Complexity

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the complexity of the isomorphism and automorphism problems for finite rings with unity. We show that both integer factorization and graph isomorphism reduce to the problem of counting automorphisms of rings. The problem is shown to be in the ...