Theory of Semi-Feasible Algorithms
Edition: 1 edition
Publisher: Springer
Published: December 5, 2002
Language: eng
Format: Hardcover
Number of pages: 148
ISBN-13: 9783540422006
Subjects: Algorithms & procedures; Computers; Algorithms (Computer Programming); Computers - Languages / Programming; Computer Books: Database; Programming - General; Programming - Algorithms; Algorithms; Circuits; Complexity; Computers / Computer Science; Computers / Programming / Algorithms; Discrete Mathematics; semi-feasible algorithms; Computational complexity; Computer Science; Computer algorithms
First sentence: Much of complexity theory focuses on the membership complexity of sets.