4940 search results - page 36 / 988 » On the Complexity of Universal Programs |
100
click to vote
FECS
2006
15 years 3 months ago
2006
-- The Fourth (4th ) Annual Student Research Symposium (SRS) for graduate and undergraduate students majoring in science, engineering, and mathematics will be conducted at Texas Ch...
114
click to vote
SODA
2001
ACM
15 years 3 months ago
2001
ACM
We explore the natural question of whether all NP-complete problems have a common restriction under which they are polynomially solvable. More precisely, we study what languages a...
PDPTA
2003
15 years 3 months ago
2003
We present a novel approach to parallel Boolean satisfiability (SAT) checking. A distinctive feature of our parallel SAT checker is that it incorporates all essential heuristics ...
COCO
2003
Springer
15 years 7 months ago
2003
Springer
We define and study strong diagonalization and compare it to weak diagonalization, implicit in [7]. Kozen’s result in [7] shows that virtually every separation can be recast as...
111
click to vote
STORYTELLING
2007
Springer
15 years 8 months ago
2007
Springer
We present Wide Ruled, an authoring tool for the creation of generative stories. It is based on the Universe author-goal-based model of story generation, and extends this model by ...