Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: Notesfiles $Revision: 1.6.2.17 $; site uokvax.UUCP
Path: utzoo!watmath!clyde!cbosgd!ihnp4!inuxc!pur-ee!uiucdcs!uokvax!seshacha
From: seshacha@uokvax.UUCP
Newsgroups: net.math
Subject: Re: Orphaned Response
Message-ID: <3300004@uokvax.UUCP>
Date: Mon, 10-Dec-84 15:59:00 EST
Article-I.D.: uokvax.3300004
Posted: Mon Dec 10 15:59:00 1984
Date-Received: Thu, 13-Dec-84 00:46:45 EST
References: <1167@psuvax1.UUCP>
Lines: 11
Nf-ID: #R:psuvax1:-116700:uokvax:3300004:37777777600:378
Nf-From: uokvax!seshacha    Dec 10 14:59:00 1984


         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.