Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!watmath!clyde!rutgers!uwvax!uwmacc!uwmcsd1!uwmeecs!litow
From: litow@uwmeecs.UUCP
Newsgroups: sci.math
Subject: Re: P = NP
Message-ID: <450@uwmeecs.UUCP>
Date: Sun, 23-Nov-86 10:00:40 EST
Article-I.D.: uwmeecs.450
Posted: Sun Nov 23 10:00:40 1986
Date-Received: Mon, 24-Nov-86 01:25:38 EST
References: <1953@emory.UUCP> <269@mipos3.UUCP> <403@cartan.Berkeley.EDU>
Organization: U of Wi-Milwaukee, Dept of EE and CS
Lines: 22

> 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

A tech abstract appears in Math. Found. of CS 1986 springer lncs 233,pp 639-
650 by O. Goldreich, S. Micali and A. Wigderson whose work grows out of
Blum's.

*** REPLACE THIS LINE WITH YOUR MESSAGE ***