SPARSE COMPLETE SETS FOR NP:
SOLUTION OF A CONJECTURE
BY MARTIN MICHAEL MUSATOV *
for llP:
Sparse Comp1ete Sets
Solution of a Conjecture
In this paper we show if NP has a sparse complete
set under many-one reductions, then ? NP.
The result is extended to show NP is sparse reducible, then P =
ip
AN ESSAY ABOUT RESEARCH (fl) ON SPARSE
NP COMPLETE SETS
By
M. Musatov
The purpose of this paper is to review the origins and motivation for
the conjecture sparse NP complete sets do not exist (unless ? NP) and
to describe the development of the ideas and techniques leading to the
recent solution of
On Apr 2, 5:36 am, Chip Eastham wrote:
> On Apr 2, 6:14 am, A Serious Moment
> cross-posted
> an OCR'd version of a 1980 paper
> by SR Mahaney, mutilating the text
> further to remove its attribution
> and create the false impression of
> authorship by the (
