| S.-G. Mantzivis, Circuits in bounded arithmetic, 1, Ann. Math. Artificial Intelligence 6 (1992), 127--156. 13 |
.... the computational complexity of the set of prime numbers There is a large body of work presenting important upper bounds on the complexity of the set of primes (including [AH87, APR83, Mil76, R80, SS77] but as was pointed out recently in [BDS98a, BDS98b, BS99, Shp98] other than the work of [Med91, Man92] almost nothing has been published regarding lower bounds on the complexity of this set. In the context of space bounded computation, it was shown in [HS68] that at least logarithmic space is required, in order to determine if a number is prime. This was improved in [HB76] to show that the same ....
S.-G. Mantzivis, Circuits in bounded arithmetic, 1, Ann. Math. Artificial Intelligence 6 (1992), 127--156.
....the set of primes (including [AH87, APR83, Mil76, R80, SS77] but Supported in part by NSF grant CCR 9734918. y Supported in part by NSF grant CCR 9700239. z Supported in part by ARC grant A69700294. as was pointed out recently in [BDS98a, BDS98b, BS99, Shp98] other than the work of [Med91, Man92] almost nothing has been published regarding lower bounds on the complexity of this set. To be sure, in the context of space bounded computation, it was shown in [HS68] that at least logarithmic space is required, in order to determine if a number is prime. This was improved in [HB76] to show ....
S.-G. Mantzivis, Circuits in bounded arithmetic, 1, Ann. Math. Artificial Intelligence 6 (1992), 127--156.
No context found.
S.-G. Mantzivis, Circuits in bounded arithmetic, 1, Ann. Math. Artificial Intelligence 6 (1992), 127--156. 13
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC