Results 1  10
of
6,675
Modular elliptic curves and Fermat’s Last Theorem
 ANNALS OF MATH
, 1995
"... When Andrew John Wiles was 10 years old, he read Eric Temple Bell’s The Last Problem and was so impressed by it that he decided that he would be the first person to prove Fermat’s Last Theorem. This theorem states that there are no nonzero integers a, b, c, n with n> 2 such that a n + b n = c n ..."
Abstract

Cited by 617 (2 self)
 Add to MetaCart
When Andrew John Wiles was 10 years old, he read Eric Temple Bell’s The Last Problem and was so impressed by it that he decided that he would be the first person to prove Fermat’s Last Theorem. This theorem states that there are no nonzero integers a, b, c, n with n> 2 such that a n + b n = c
An introduction to Kolmogorov Complexity and its Applications: Preface to the First Edition
, 1997
"... This document has been prepared using the L a T E X system. We thank Donald Knuth for T E X, Leslie Lamport for L a T E X, and Jan van der Steen at CWI for online help. Some figures were prepared by John Tromp using the xpic program. The London Mathematical Society kindly gave permission to reproduc ..."
Abstract

Cited by 2138 (120 self)
 Add to MetaCart
This document has been prepared using the L a T E X system. We thank Donald Knuth for T E X, Leslie Lamport for L a T E X, and Jan van der Steen at CWI for online help. Some figures were prepared by John Tromp using the xpic program. The London Mathematical Society kindly gave permission
Recursive Functions of Symbolic Expressions and Their Computation by Machine, Part I
, 1960
"... this paper in L a T E Xpartly supported by ARPA (ONR) grant N000149410775 to Stanford University where John McCarthy has been since 1962. Copied with minor notational changes from CACM, April 1960. If you want the exact typography, look there. Current address, John McCarthy, Computer Science Depa ..."
Abstract

Cited by 457 (3 self)
 Add to MetaCart
this paper in L a T E Xpartly supported by ARPA (ONR) grant N000149410775 to Stanford University where John McCarthy has been since 1962. Copied with minor notational changes from CACM, April 1960. If you want the exact typography, look there. Current address, John McCarthy, Computer Science
Probabilistic checking of proofs: a new characterization of NP
 JOURNAL OF THE ACM
, 1998
"... We give a new characterization of NP: the class NP contains exactly those languages L for which membership proofs (a proof that an input x is in L) can be verified probabilistically in polynomial time using logarithmic number of random bits and by reading sublogarithmic number of bits from the proof ..."
Abstract

Cited by 414 (26 self)
 Add to MetaCart
We give a new characterization of NP: the class NP contains exactly those languages L for which membership proofs (a proof that an input x is in L) can be verified probabilistically in polynomial time using logarithmic number of random bits and by reading sublogarithmic number of bits from
Purify: Fast detection of memory leaks and access errors
 In Proc. of the Winter 1992 USENIX Conference
, 1991
"... This paper describes Purifyru, a software testing and quality assurance Ool that detects memory leaks and access erors. Purify inserts additional checking instructions directly into the object code produced by existing compilers. These instructions check every memory read and write performed by the ..."
Abstract

Cited by 354 (0 self)
 Add to MetaCart
This paper describes Purifyru, a software testing and quality assurance Ool that detects memory leaks and access erors. Purify inserts additional checking instructions directly into the object code produced by existing compilers. These instructions check every memory read and write performed
Users' Guide for the HarwellBoeing Sparse Matrix Collection (Release I)
, 1992
"... We describe the complete set of matrices in the HarwellBoeing sparse matrix collection, a set of standard test matrices for sparse matrix problems. This description includes some documentation for each matrix (or set of matrices) in the collection. We also describe how a copy of the collection may ..."
Abstract

Cited by 265 (23 self)
 Add to MetaCart
as Technical Report TR/PA/92/86 from CERFACS, 42 Ave G Coriolis, 31057 Toulouse Cedex, France. 2 isd@rl.ac.uk 3 john.g.lewis@boeing.com and roger.g.grimes@boeing.com. Research and Technology Division, Boeing Computer Services, Mail Stop 7L21, P. O. Box 24236, Seattle, WA 981240346, USA. Supported in part
The attribution of attitudes
 J. Exp. Soc. Psychol
, 1967
"... Three experiments were conducted within the framework of correspondent inference theory. In each of the experiments the subjects were instructed to estimate the "trueJ ' attitude of a target person after having either read or listened to a speech by him expressing opinions on a controversi ..."
Abstract

Cited by 187 (0 self)
 Add to MetaCart
Three experiments were conducted within the framework of correspondent inference theory. In each of the experiments the subjects were instructed to estimate the "trueJ ' attitude of a target person after having either read or listened to a speech by him expressing opinions on a
READS
, 2016
"... Genotypespecific regulation of coldresponsive genes in cypress (Cupressus sempervirens L.) ..."
Abstract
 Add to MetaCart
Genotypespecific regulation of coldresponsive genes in cypress (Cupressus sempervirens L.)
READS
, 2016
"... Genotypespecific regulation of coldresponsive genes in cypress (Cupressus sempervirens L.) ..."
Abstract
 Add to MetaCart
Genotypespecific regulation of coldresponsive genes in cypress (Cupressus sempervirens L.)
Results 1  10
of
6,675