8824 search results - page 122 / 1765 » On the Complexity of Real Functions |
137
click to vote
FSTTCS
2009
Springer
15 years 11 months ago
2009
Springer
We clarify the role of Kolmogorov complexity in the area of randomness extraction. We show that a computable function is an almost randomness extractor if and only if it is a Kolm...
161
click to vote
LPAR
2007
Springer
15 years 10 months ago
2007
Springer
We study the data complexity of instance checking and conjunctive query answering in the EL family of description logics, with a particular emphasis on the boundary of tractability...
143
click to vote
WOLLIC
2010
Springer
15 years 9 months ago
2010
Springer
Proof theoretic characterizations of complexity classes are of considerable interest because they link levels of conceptual abstraction to computational complexity. We consider he...
132
click to vote
ATAL
2004
Springer
15 years 9 months ago
2004
Springer
We highlight the limitations of formal methods by exhibiting two results in recursive function theory: that there is no effective means of finding a program that satisfies a given...
128
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
We present a new example of a partial boolean function whose one-way quantum communication complexity is exponentially lower than its one-way classical communication complexity. T...