8824 search results - page 279 / 1765 » On the Complexity of Real Functions |
212
click to vote
COCO
2000
Springer
15 years 11 months ago
2000
Springer
It is known that the classical and quantum query complexities of a total Boolean function f are polynomially related to the degree of its representing polynomial, but the optimal ...
194
click to vote
CIE
2011
Springer
14 years 6 months ago
2011
Springer
Abstract. In [She82], it is shown that four of its basic functional properties are enough to characterize plain Kolmogorov complexity, hence obtaining an axiomatic characterization...
202
click to vote
JCSS
2008
15 years 6 months ago
2008
Given a Boolean function f, we study two natural generalizations of the certificate complexity C (f): the randomized certificate complexity RC (f) and the quantum certificate comp...
183
click to vote
ICECCS
2005
IEEE
16 years 7 days ago
2005
IEEE
Middleware enables distributed components to interact with each others in diverse and complex manners. Such interactions should be modeled at architecture level for controlling th...
198
click to vote
RTA
2010
Springer
15 years 10 months ago
2010
Springer
In earlier work, we have shown that for confluent term rewrite systems (TRSs for short), innermost polynomial runtime complexity induces polytime computability of the functions de...