4940 search results - page 424 / 988 » On the Complexity of Universal Programs |
196
click to vote
ICALP
2000
Springer
15 years 10 months ago
2000
Springer
We establish that the algorithmic complexity of the minimum spanning tree problem is equal to its decision-tree complexity. Specifically, we present a deterministic algorithm to fi...
166
click to vote
ICALP
2000
Springer
15 years 10 months ago
2000
Springer
Today many formalisms exist for specifying complex Markov chains. In contrast, formalism for specifying the quantitative properties to analyze have remained quite primitive. In th...
198
click to vote
IFIP
2000
Springer
15 years 10 months ago
2000
Springer
We are developing scientific software component technology to manage the complexity of modern, parallel simulation software and increase the interoperability and re-use of scientif...
147
click to vote
IFIP
2000
Springer
15 years 10 months ago
2000
Springer
Information systems research is concerned with complex imbroglios of human and non-human components. As researchers, we need ways to represent the intricacies of the different sta...
165
click to vote
ICALP
1995
Springer
15 years 10 months ago
1995
Springer
We show that if a self-reducible set has polynomial-size circuits, then it is low for the probabilistic class ZPP(NP). As a consequence we get a deeper collapse of the polynomial-...