Randomness and Completeness in Computational Complexity
Edition: 1 edition
Publisher: Springer
Published: January 25, 2001
Language: eng
Format: Paperback
Number of pages: 211
ISBN-13: 9783540414926
Subjects: Algorithms & procedures; General Theory of Computing; Machine Theory; Computer Mathematics; Theory Of Computing; Computers; Computers - General Information; Science/Mathematics; Mathematics; Logic Design; Algorithms; Complete Languages; Completeness; Complexity Theory; Computers / Computer Science; Formal Language Theory; Game Theory; Computer Science; Programming - General; Computational complexity
First sentence: How can we solve a problem using computers in a reasonable amount of time?
Notes: Lecture Notes in Computer Science