7106 search results - page 78 / 1422 » Restricted Complexity, General Complexity |
COCO
2009
Springer
14 years 2 months ago
2009
Springer
A major open question in communication complexity is if randomized and quantum communication are polynomially related for all total functions. So far, no gap larger than a power o...
ICDE
2006
IEEE
14 years 1 months ago
2006
IEEE
Due to the flexible structures of SQL, no general approach works efficiently for all kinds of queries. Some special kinds of queries can be further optimized for better performa...
CSL
2000
Springer
14 years 2 days ago
2000
Springer
We study definability of languages in arithmetic and the free monoid by bounded versions of fixed-point and transitive-closure logics. In particular we give logical characterisat...
ICALP
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. We obtain new results regarding the precise average bitcomplexity of five algorithms of a broad Euclidean type. We develop a general framework for analysis of algorithms,...
MP
2006
13 years 7 months ago
2006
Stochastic programming is the subfield of mathematical programming that considers optimization in the presence of uncertainty. During the last four decades a vast amount of litera...