Next:
4.1 Example of a
Up:
Fundamentals of Computing
Previous:
3.4 Fast and Lean
4 Nondeterminism; Inverting Functions; Reductions.
4.1 Example of a Narrow Computation: Inverting a Function.
4.2 Complexity of NP Problems.
4.3 An NP-Complete Problem: Tiling.
Leonid Levin
Wed Aug 21 20:35:42 EDT 1996
