4940 search results - page 111 / 988 » On the Complexity of Universal Programs |
128
click to vote
COCO
2006
Springer
15 years 8 months ago
2006
Springer
We study two quite different approaches to understanding the complexity of fundamental problems in numerical analysis. We show that both hinge on the question of understanding the...
127
click to vote
IFIP
2000
Springer
15 years 8 months ago
2000
Springer
New non-desktop technologies may turn out to be of a more open and generic nature than traditional information technologies. These technologies consequently pose novel challenges ...
152
click to vote
IFIP
2000
Springer
15 years 8 months ago
2000
Springer
ducational Resources Information Center) the on-line education abstracts, show 15,000 entries under "computers and education" since 1992. Adoption of some level of inform...
130
click to vote
ICALP
2009
Springer
16 years 4 months ago
2009
Springer
Ong has shown that the modal mu-calculus model checking problem (equivalently, the alternating parity tree automaton (APT) acceptance problem) of possibly-infinite ranked trees gen...
142
click to vote
ICALP
2001
Springer
15 years 9 months ago
2001
Springer
We prove a lower bound of (n4/3 log1/3 n) on the randomized decision tree complexity of any nontrivial monotone n-vertex graph property, and of any nontrivial monotone bipartite g...