Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP Posting-Version: notesfiles Path: utzoo!watmath!clyde!burl!ulysses!unc!mcnc!decvax!tektronix!hplabs!hp-pcd!uokvax!seshacha From: seshacha@uokvax.UUCP (seshacha) Newsgroups: net.math Subject: Re: Orphaned Response Message-ID: <3300004@uokvax.UUCP> Date: Tue, 8-Jan-85 11:11:00 EST Article-I.D.: uokvax.3300004 Posted: Tue Jan 8 11:11:00 1985 Date-Received: Thu, 17-Jan-85 13:25:18 EST References: <-116700@psuvax1.UUCP> Lines: 10 Nf-ID: #R:psuvax1:-116700:uokvax:3300004:37777777600:379 Nf-From: uokvax!seshacha Jan 12 08:11:00 1985 This is in response to Karmarkar paper in ACM symposium on automata(1983)... I could not find any paper authored by him except another paper on the Knapscak problem with reduced complexity. Could anyone kindly give the correct source of this? Another request: If anyone has an algorithm to generate palindromic primes,please mail one to me.