4940 search results - page 162 / 988 » On the Complexity of Universal Programs |
90
Voted
SIGSOFT
2003
ACM
16 years 5 months ago
2003
ACM
d Abstract) Eunyoung Lee Andrew W. Appel Department of Computer Science Princeton University {elee,appel}@cs.princeton.edu Categories and Subject Descriptors D.2.4 [Software Engine...
234
click to vote
CP
2009
Springer
16 years 5 months ago
2009
Springer
The length-lex representation for set variables orders all subsets of a given universe of values according to cardinality and lexicography. To achieve length-lex bounds consistency...
138
click to vote
ICALP
2007
Springer
15 years 11 months ago
2007
Springer
Valiant’s theory of holographic algorithms is a novel methodology to achieve exponential speedups in computation. A fundamental parameter in holographic algorithms is the dimens...
150
Voted
FECS
2010
15 years 3 months ago
2010
This paper describes the experience of teaching robotics at the freshman level, from the conception of the project through the offering of a computer science seminar in robotics, h...
166
Voted
PPDP
2009
Springer
15 years 11 months ago
2009
Springer
We introduce a logic programming framework for data type transformations based on isomorphisms between elementary data types (natural numbers, finite functions, sets and permutat...