535 search results - page 46 / 107 » Checking Computations in Polylogarithmic Time |
FOSSACS
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. We introduce a domain-theoretic computational model for multivariable differential calculus, which for the first time gives rise to data types for differentiable functio...
DAC
2009
ACM
14 years 10 months ago
2009
ACM
Continuously shrinking feature sizes result in an increasing susceptibility of circuits to transient faults, e.g. due to environmental radiation. Approaches to implement fault tol...
CADE
2002
Springer
14 years 9 months ago
2002
Springer
We show that a conjunctive normal form (CNF) formula F is unsatisfiable iff there is a set of points of the Boolean space that is stable with respect to F. So testing the satisfiab...
LCPC
2001
Springer
14 years 1 months ago
2001
Springer
This paper deals with the problem of statically inferring the shape of an array in languages such as MATLAB. Inferring an array’s shape is desirable because it empowers better co...
FOCS
2009
IEEE
14 years 3 months ago
2009
IEEE
We consider the Item Pricing problem for revenue maximization in the limited supply setting, where a single seller with n items caters to m buyers with unknown subadditive valuati...