Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.2 9/18/84; site brl-tgr.ARPA
Path: utzoo!watmath!clyde!bonnie!akgua!sdcsvax!sdcrdcf!hplabs!hao!seismo!brl-tgr!broome
From: broome@brl-tgr.ARPA (Paul Broome )
Newsgroups: net.math
Subject: Re: Info wanted on Karmarkar algorithm
Message-ID: <6499@brl-tgr.ARPA>
Date: Sat, 8-Dec-84 17:08:23 EST
Article-I.D.: brl-tgr.6499
Posted: Sat Dec  8 17:08:23 1984
Date-Received: Mon, 10-Dec-84 02:58:07 EST
References: <288@cubsvax.UUCP>
Reply-To: broome@brl-tgr.ARPA (Paul Broome (CTAB) )
Organization: Ballistic Research Lab
Lines: 22


A reference was posted to the THEORY mailing list on MILNET a couple
of weeks ago.  I haven't read the paper.  

--------------------------------------------------
Date: 27 Nov 1984 17:19:38-EST (Tuesday)
From: S.Miller@WISC-RSCH.ARPA
To: @THEORY,@WISC-RSCH:
Subject: Karmarkar Algorithm
Resent-From: Udi Manber 

The Karmarkar algorithm was presented at STOC (Symposium on Theory of
Computing) on May 1, 1984 (STOC '84, p. 302)
"A New Polynomial time Algorithm on Linear Programming".
The STOC proceedings are available from the ACM if your
location doesn't have them.

---------------------------------

Anyone have an informed opinion?

-paul broome