3228 search results - page 220 / 646 » Computationally Sound Proofs |
303
click to vote
POPL
2009
ACM
16 years 7 months ago
2009
ACM
This paper describes an inter-procedural technique for computing symbolic bounds on the number of statements a procedure executes in terms of its scalar inputs and user-defined qu...
173
click to vote
FOCS
2006
IEEE
16 years 20 days ago
2006
IEEE
We advance significantly beyond the recent progress on the algorithmic complexity of Nash equilibria by solving two major open problems in the approximation of Nash equilibria an...
175
click to vote
MKM
2004
Springer
15 years 12 months ago
2004
Springer
This paper reports on refinements and extensions to the MathLang framework that add substantial support for natural language text. We show how the extended framework supports mult...
168
click to vote
ENTCS
2007
15 years 6 months ago
2007
The basic motivation behind this work is to tie together various computational complexity classes, whether over different domains such as the naturals or the reals, or whether de...
206
Voted
FUN
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. We analyze the computational complexity of various twodimensional platform games. We identify common properties of these games that allow us to state several meta-theorem...