221 search results - page 17 / 45 » Analyzing the Implicit Computational Complexity of object-or... |
153
click to vote
ENTCS
2006
15 years 1 months ago
2006
It is a well-known fact that algorithms are often hidden inside mathematical proofs. If these proofs are formalized inside a proof assistant, then a mechanism called extraction ca...
108
click to vote
COCOA
2007
Springer
15 years 8 months ago
2007
Springer
We define a fundamental domain for a linear programming relaxation of a combinatorial integer program which is symmetric under a group action. We then describe a straightforward w...
226
click to vote
POPL
2009
ACM
16 years 2 months ago
2009
ACM
Self-adjusting computation is an evaluation model in which programs can respond efficiently to small changes to their input data by using a change-propagation mechanism that updat...
105
click to vote
DCC
2005
IEEE
16 years 1 months ago
2005
IEEE
We analyze the technique for reducing the complexity of entropy coding consisting in the a priori grouping of the source alphabet symbols, and in dividing the coding process in tw...
220
Voted
POPL
2006
ACM
16 years 2 months ago
2006
ACM
Abstract. This paper investigates what is essentially a call-by-value version of PCF under a complexity-theoretically motivated type system. The programming formalism, ATR, has its...