4940 search results - page 80 / 988 » On the Complexity of Universal Programs |
159
click to vote
SODA
2000
ACM
15 years 5 months ago
2000
ACM
We present a new general upper bound on the number of examples required to estimate all of the expectations of a set of random variables uniformly well. The quality of the estimat...
140
click to vote
IANDC
2006
15 years 4 months ago
2006
We provide machine-independent characterizations of some complexity classes, over an arbitrary structure, in the model of computation proposed by L. Blum, M. Shub and S. Smale. We...
139
click to vote
JACM
2002
15 years 4 months ago
2002
An exponential lower bound on the circuit complexity of deciding the weak monadic second-order theory of one successor (WS1S) is proved. Circuits are built from binary operations, ...
174
click to vote
SCESM
2006
ACM
15 years 10 months ago
2006
ACM
As technical systems keep growing more complex and sophisticated, designing software for the safety-critical coordination between their components becomes increasingly difficult....
107
click to vote
CCA
2009
Springer
15 years 11 months ago
2009
Springer
d Abstract) Robert Rettinger1 Department of Mathematics and Computer Science University of Hagen, Germany Abstract. We show that under reasonable assumptions there exist Riemann ma...