Sciweavers

3299 search results - page 501 / 660
» A general mathematics of names
Sort
View
JCSS
2000
116views more  JCSS 2000»
15 years 6 months ago
Time-Space Tradeoffs for Satisfiability
We give the first nontrivial model-independent time-space tradeoffs for satisfiability. Namely, we show that SAT cannot be solved simultaneously in n1+o(1) time and n1space for an...
Lance Fortnow
ETT
2002
93views Education» more  ETT 2002»
15 years 6 months ago
Quantum simulation - rare event simulation by means of cloning, thinning and distortion
A method of rare event simulation, termed here quantum simulation, and known also (with some variations) as population Monte Carlo, and Sequential Markov Chain simulation, is appli...
R. G. Addie
ALGORITHMICA
1998
90views more  ALGORITHMICA 1998»
15 years 6 months ago
Dynamics of the Binary Euclidean Algorithm: Functional Analysis and Operators
We provide here a complete average-case analysis of the binary continued fraction representation of a random rational whose numerator and denominator are odd and less than N. We an...
Brigitte Vallée
CL
1999
Springer
15 years 6 months ago
Optimizing floating point operations in Scheme
It is well known that dynamic typing in languages like Lisp is costly in terms of performance. Besides the cost of tag checking, the other major source of ine ciency comes from th...
W. F. Wong
CN
1999
143views more  CN 1999»
15 years 6 months ago
Embedding Knowledge in Web Documents
The paper argues for the use of general and intuitive knowledge representation languages (and simpler notational variants, e.g. subsets of natural languages) for indexing the cont...
Philippe Martin, Peter W. Eklund