13603 search results - page 310 / 2721 » On the Computational Complexity of Cut-Reduction |
153
click to vote
CAV
2009
Springer
16 years 7 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...
198
click to vote
ICS
2010
Tsinghua U.
16 years 4 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 ...
166
click to vote
ARITH
2003
IEEE
16 years 5 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...