Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!watmath!clyde!rutgers!sri-unix!hplabs!ucbvax!cartan!brahms!lieman
From: lieman@brahms.UUCP
Newsgroups: sci.math
Subject: Re: P = NP
Message-ID: <403@cartan.Berkeley.EDU>
Date: Sat, 22-Nov-86 01:21:58 EST
Article-I.D.: cartan.403
Posted: Sat Nov 22 01:21:58 1986
Date-Received: Sun, 23-Nov-86 03:20:10 EST
References: <1953@emory.UUCP> <269@mipos3.UUCP>
Sender: daemon@cartan.Berkeley.EDU
Reply-To: lieman@brahms (Dan Lieman)
Organization: Math Dept. UC Berkeley
Lines: 16
Summary: Zero information proofs

Sounds to me like you heard about Manuel Blum's recent results in the
area of zero information proofs.  For example, he examines the question
of whether I can convince you that I have proved a certain result, without
telling you anything about the result.  He claims that this is possible.

This result has great bearing on P = NP, but I don't believe it solves it.
It might be best if you sent him a note, and asked him to post a summary
to an appropriate newsgroup.  He's a nice guy; he should oblige.  He's
at:
		  blum@ernie.berkeley.edu
		  ...ucbvax!ernie!blum     (I think)

Hope this helps.

Daniel Lieman
lieman@brahms.berkeley.edu