1888 search results - page 154 / 378 » Proof theory and computational analysis |
153
click to vote
FOCS
2000
IEEE
15 years 5 months ago
2000
IEEE
In this article, we show several results obtained by combining the use of stable distributions with pseudorandom generators for bounded space. In particular: —We show that, for a...
131
Voted
ICDT
2012
ACM
13 years 3 months ago
2012
ACM
A universal model of a database D and a set Σ of integrity constraints is a database that extends D, satisfies Σ, and is most general in the sense that it contains sound and co...
120
click to vote
ESOP
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. We survey recent developments in an approach to the verification of higher-order computation based on game semantics. Higherorder recursion schemes are in essence (progra...
117
Voted
FOCS
2008
IEEE
15 years 7 months ago
2008
IEEE
The central problem in computational mechanism design is the tension between incentive compatibility and computational ef ciency. We establish the rst significant approximability ...
94
Voted
COMGEO
1999
ACM
15 years 10 days ago
1999
ACM
Many algorithms for reducing the number of triangles in a surface model have been proposed, but to date there has been little theoretical analysis of the approximations they produ...