4940 search results - page 351 / 988 » On the Complexity of Universal Programs |
171
click to vote
JCT
2000
15 years 6 months ago
2000
We give a strongly polynomial-time algorithm minimizing a submodular function f given by a value-giving oracle. The algorithm does not use the ellipsoid method or any other linear ...
287
click to vote
ICFP
2009
ACM
16 years 7 months ago
2009
ACM
Purely functional programs should run well on parallel hardware because of the absence of side effects, but it has proved hard to realise this potential in practice. Plenty of pap...
200
click to vote
ICFP
2002
ACM
16 years 6 months ago
2002
ACM
Compilers for dynamically and statically typed languages ensure safe execution by verifying that all operations are performed on appropriate values. An operation as simple as car ...
193
click to vote
LPNMR
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. In answer-set programming (ASP), many notions of program equivalence have been introduced and formally analysed. A particular line of research in this direction aims at s...
167
click to vote
FMCO
2007
Springer
16 years 26 days ago
2007
Springer
This paper describes the architecture of costa, an abstract interpretation based cost and termination analyzer for Java bytecode. The system receives as input a bytecode program, (...