4940 search results - page 129 / 988 » On the Complexity of Universal Programs |
168
click to vote
CSR
2011
Springer
14 years 8 months ago
2011
Springer
Abstract. Many theorems about Kolmogorov complexity rely on existence of combinatorial objects with specific properties. Usually the probabilistic method gives such objects with b...
133
click to vote
CADE
2009
Springer
15 years 11 months ago
2009
Springer
predicate abstraction Shuvendu K. Lahiri and Shaz Qadeer Microsoft Research In this paper, we investigate the asymptotic complexity of various predicate abstraction problems relati...
157
click to vote
ICSOC
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. The modularity of Service-oriented Architectures (SOA) allows to establish complex distributed systems comprising e.g., services, clients, brokers, and workflow engines. ...
166
click to vote
ICALP
2011
Springer
14 years 8 months ago
2011
Springer
Competitive analysis is the established tool for measuring the output quality of algorithms that work in an online environment. Recently, the model of advice complexity has been in...
142
click to vote
ICALP
2001
Springer
15 years 9 months ago
2001
Springer
We consider the quantum complexities of the following three problems: searching an ordered list, sorting an un-ordered list, and deciding whether the numbers in a list are all dis...