Publication

2001-12-18 - Springer

Language

English

Word Count

95,500 words, Guess

Page Count

382 pages

Physical Format

Hardcover

Identifiers

First Sentence

Before we turn to Mahaneys Theorem-NP has sparse complete sets only if P = NP-and its generalization to bounded-truth-table reductions, we first prove two weaker results that display the self-reducibility-based tree-pruning approach in a simpler setting.

Subjects

Similar Books

Reader Reviews

No reviews yet for this book.

Be the first to share your thoughts!