17541 search results - page 408 / 3509 » Complexity in scalable computing |
113
click to vote
CAV
2009
Springer
16 years 5 months ago
2009
Springer
The SPEED project addresses the problem of computing symbolic computational complexity bounds of procedures in terms of their inputs. We discuss some of the challenges that arise a...
151
Voted
IFIPTCS
2010
15 years 3 months ago
2010
Schnorr famously proved that Martin-L
152
Voted
GC
2011
Springer
14 years 8 months ago
2011
Springer
165
click to vote
ICS
2010
Tsinghua U.
16 years 2 months ago
2010
Tsinghua U.
Computation in the physical world is restricted by the following spatial locality constraint: In a single unit of time, information can only travel a bounded distance in space. A ...
134
Voted
ARITH
2003
IEEE
15 years 10 months 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...