921 search results - page 100 / 185 » Expressing Computational Complexity in Constructive Type The... |
ICALP
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. We give an fpt approximation algorithm for the directed vertex disjoint cycle problem. Given a directed graph G with n vertices and a positive integer k, the algorithm co...
CAISE
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. Parthood is a relation of fundamental importance in a number of disciplines including cognitive science, linguistics and conceptual modeling. However, one classical probl...
SIGSOFT
2006
ACM
14 years 1 months ago
2006
ACM
Interpolation based automatic abstraction is a powerful and robust technique for the automated analysis of hardware and software systems. Its use has however been limited to contr...
CORR
2004
Springer
13 years 7 months ago
2004
Springer
While most polynomial Julia sets are computable, it has been recently shown [12] that there exist non-computable Julia sets. The proof was non-constructive, and indeed there were ...
ICFP
2002
ACM
14 years 8 months ago
2002
ACM
Meta-programming is a discipline of writing programs in a certain programming language that generate, manipulate or execute programs written in another language. In a typed settin...