Completeness Proofs (Part I)



next up previous contents
Next: Distributional Halting (Version Up: Average-Case Intractable NP Problems Previous: Distributional Matrix Representability

Completeness Proofs (Part I)

 

We present in this section the completeness proofs for the distributional halting problem (version 1) and the distributional tiling problem, which are the simplest completeness proofs.





Jie Wang
Mon Feb 3 15:13:50 EST 1997