A lower bound for integer multiplication with read-once branching programs
Stephen J. Ponzio · 1995
Article Free Access Share on A lower bound for integer multiplication with read-once branching programs Author: Stephen Ponzio MIT Laboratory for Computer Science MIT Laboratory for Computer ScienceView Profile Authors Info & Claims STOC '95: Proceedings of the twenty-seventh annual ACM symposium on Theory of computingMay 1995Pages 130–139https://doi.org/10.1145/225058.225098Published:29 May 1995Publication History 22citation329DownloadsMetricsTotal Citations22Total Downloads329Last 12 Months11Last 6 weeks4 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