4940 search results - page 98 / 988 » On the Complexity of Universal Programs |
137
click to vote
ICALP
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. We show lower bounds in the cell probe model for the redundancy/query time tradeoff of solutions to static data structure problems.
129
click to vote
ICALP
2000
Springer
15 years 8 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,...
122
click to vote
VLSID
2007
IEEE
16 years 4 months ago
2007
IEEE
? We give a new recursive rounding linear programming (LP) solution to the problem of N-detect test minimzation. This is a polynomialtime solution that closely approximates the exa...
142
click to vote
KR
2004
Springer
15 years 9 months ago
2004
Springer
The main contribution of this paper is the definition of the preference description language ¡¢ . This language allows us to combine qualitative and quantitative, penalty bas...
110
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
The tendency of semidefinite programs to compose perfectly under product has been exploited many times in complexity theory: for example, by Lov