Functions with bounded symmetric communication complexity and circuits with mod m gates
Márió Szegedy · 1990
Article Free Access Share on Functions with bounded symmetric communication complexity and circuits with mod m gates Author: M. Szegedy The Hebrew University, Jerusalem 91904, Israel, Computer Science Department of The University of Chicago The Hebrew University, Jerusalem 91904, Israel, Computer Science Department of The University of ChicagoSearch about this author Authors Info & Claims STOC '90: Proceedings of the twenty-second annual ACM symposium on Theory of ComputingApril 1990Pages 278–286https://doi.org/10.1145/100216.100252Published:01 April 1990Publication History 4citation243DownloadsMetricsTotal Citations4Total Downloads243Last 12 Months12Last 6 weeks0 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF