1686 search results - page 37 / 338 » Programs as polygraphs: computability and complexity |
CSR
2009
Springer
15 years 4 months ago
2009
Springer
Muchnik’s theorem about simple conditional descriptions states that for all strings a and b there exists a short program p transforming a to b that has the least possible length ...
GECCO
2007
Springer
15 years 3 months ago
2007
Springer
In this paper, we analyze two general-purpose encoding types, trees and graphs systematically, focusing on trends over increasingly complex problems. Tree and graph encodings are ...
75
Voted
PPOPP
1995
ACM
15 years 1 months ago
1995
ACM
paper we describe d/streams, a language-independent abstraction with a small set of simple primitives for buffered I/O on distributed data-structures. We describe the interface an...
121
click to vote
CCGRID
2010
IEEE
14 years 10 months ago
2010
IEEE
Geo-sciences involve large-scale parallel models, high resolution real time data from highly asynchronous and heterogeneous sensor networks and instruments, and complex analysis a...
AAAI
2008
14 years 12 months ago
2008
We argue that parameterized complexity is a useful tool with which to study global constraints. In particular, we show that many global constraints which are intractable to propag...