Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

101

Voted

STOC
1991
ACM

109views Algorithms» more STOC 1991»

Checking Computations in Polylogarithmic Time

15 years 6 months ago

Checking Computations in Polylogarithmic Time

Download people.cs.uchicago.edu

László Babai, Lance Fortnow, Leonid

Real-time Traffic

Algorithms | STOC 1991 |

claim paper

Related Content

» On the Complexity of SAT

» Estimating the Longest Increasing Sequence in Polylogarithmic Time

» A distributed polylogarithmic time algorithm for selfstabilizing skip graphs

» Deterministic Distributed Construction of Linear Stretch Spanners in Polylogarithmic Time

» Deterministic distributed vertex coloring in polylogarithmic time

» Fast Deterministic Distributed Maximal Independent Set Computation on GrowthBounded Graphs

» Lower Bounds on the Computational Power of an Optical Model of Computation

» Upper Bounds on the Computational Power of an Optical Model of Computation

» RangeAggregate Proximity Detection for Design Rule Checking in VLSI Layouts

Post Info
More Details (n/a)

Added	27 Aug 2010
Updated	27 Aug 2010
Type	Conference
Year	1991
Where	STOC
Authors	László Babai, Lance Fortnow, Leonid A. Levin, Mario Szegedy

Comments (0)