1686 search results - page 59 / 338 » Programs as polygraphs: computability and complexity |
ICALP
2003
Springer
15 years 2 months ago
2003
Springer
Kolmogorov complexity measures the ammount of information in a string as the size of the shortest program that computes the string. The Kolmogorov structure function divides the s...
IPPS
2003
IEEE
15 years 3 months ago
2003
IEEE
We propose a method for the timing analysis of concurrent real-time programs with hard deadlines. We divide the analysis into a machine-independent and a machinedependent task. Th...
109
click to vote
ENTCS
2006
14 years 9 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...
ECOOP
1995
Springer
15 years 1 months ago
1995
Springer
Abstract. Meta-levels are complex pieces of software with diverse demands in both the computation and interaction domains. Common techniques using just code to express behaviour fa...
COCOA
2007
Springer
15 years 3 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...