Access Restriction

Author Rabin, Michael O.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Probabilistic algorithms ♦ Intractable problems ♦ Algebraic complexity ♦ Complexity of computations
Abstract The framework for research in the theory of complexity of computations is described, emphasizing the interrelation between seemingly diverse problems and methods. Illustrative examples of practical and theoretical significance are given. Directions for new research are discussed.
Description Affiliation: Hebrew Univ. of Jerusalem, Jerusalem, Israel (Rabin, Michael O.)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 20
Issue Number 9
Page Count 9
Starting Page 625
Ending Page 633

Open content in new tab

   Open content in new tab
Source: ACM Digital Library