36781 search results - page 335 / 7357 » Parameterizing by the Number of Numbers |
165
click to vote
MBEC
2011
14 years 10 months ago
2011
er of words of the abstract: 191 The number of figures: 4 The number of tables: 4
160
Voted
GD
2009
Springer
16 years 2 days ago
2009
Springer
We show that cr(G) ≤ 2 iocr(G) 2 settling an open problem of Pach and T´oth [4, 1]. Moreover, iocr(G) = cr(G) if iocr(G) ≤ 2. 1 Crossing Numbers Pach and T´oth point out in ...
182
click to vote
ARITH
2003
IEEE
16 years 23 days ago
2003
IEEE
Multiplication of two numbers represented in base is shown to be computable by an on-line algorithm when is a negative integer, a positive non-integer real number, or a comp...
182
click to vote
DNA
2001
Springer
15 years 12 months ago
2001
Springer
A DNA algorithm for SAT, the satisfiability of propositional formulae, is presented where the number of separation steps is given by the number of clauses of the instance. This re...
239
click to vote
CSREASAM
2009
15 years 8 months ago
2009
Tantra 1 is a novel Pseudorandom number generator (PRNG) design that provides a long sequence high quality pseudorandom numbers at very high rate both in software and hardware impl...