921 search results - page 88 / 185 » Expressing Computational Complexity in Constructive Type The... |
ICDE
2010
IEEE
14 years 7 months ago
2010
IEEE
Scientific workflows are increasingly used for rapid integration of existing algorithms to form larger and more comgrams. Such workflows promise to provide more abstract, yet execu...
STOC
2004
ACM
14 years 8 months ago
2004
ACM
We present an explicit construction of codes that can be list decoded from a fraction (1 - ) of errors in sub-exponential time and which have rate / logO(1) (1/). This comes close...
CCA
2009
Springer
13 years 12 months ago
2009
Springer
Abstract. In this paper we study a new approach to classify mathematical theorems according to their computational content. Basically, we are asking the question which theorems can...
FOSSACS
2003
Springer
14 years 1 months ago
2003
Springer
Genericity is the idea that the same program can work at many different data types. Longo, Milstead and Soloviev proposed to capture the inability of generic programs to probe th...
ACTA
2007
13 years 8 months ago
2007
Abstract. In order to design and analyse complex systems, modelers need formal models with two contradictory requirements: a high expressivity and the decidability of behavioural p...