Checking computations in polylogarithmic time

Abstract

Article Free Access Share on Checking computations in polylogarithmic time Authors: László Babai Univ. of Chicago and Eötvoö Univ., Budapest Univ. of Chicago and Eötvoö Univ., BudapestView Profile , Lance Fortnow Dept. Comp. Sci., Univ. of Chicago, 1100 E 58th St, Chicago IL Dept. Comp. Sci., Univ. of Chicago, 1100 E 58th St, Chicago ILView Profile , Leonid A. Levin Dept. Comp. Sci., Boston University, 111 cummington St., Boston MA Dept. Comp. Sci., Boston University, 111 cummington St., Boston MAView Profile , Mario Szegedy Dept. Comp. Sci., Univ. of Chicago, 1100 E 58th St, Chicago IL Dept. Comp. Sci., Univ. of Chicago, 1100 E 58th St, Chicago ILView Profile Authors Info & Claims STOC '91: Proceedings of the twenty-third annual ACM symposium on Theory of ComputingJanuary 1991 Pages 21–32https://doi.org/10.1145/103418.103428Online:03 January 1991Publication History 325citation1,050DownloadsMetricsTotal Citations325Total Downloads1,050Last 12 Months79Last 6 weeks15 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