1092 search results - page 129 / 219 » Polynomial Interpretations and the Complexity of Algorithms |
136
click to vote
COCO
2010
Springer
15 years 10 months ago
2010
Springer
—In this paper we show that BPP is truth-table reducible to the set of Kolmogorov random strings RK . It was previously known that PSPACE, and hence BPP is Turingreducible to RK ...
220
click to vote
CP
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Inspired by AND/OR search spaces for graphical models recently introduced, we propose to augment Ordered Decision Diagrams with AND nodes, in order to capture function de...
152
click to vote
IJCAI
2001
15 years 7 months ago
2001
Market mechanisms play a central role in AI as a coordination tool in multiagent systems and as an application area for algorithm design. Mechanisms where buyers are directly clea...
150
click to vote
AAAI
2000
15 years 7 months ago
2000
We present a new algorithm that reduces the space complexity of heuristic search. It is most effective for problem spaces that grow polynomially with problem size, but contain lar...
186
click to vote
CONSTRAINTS
2008
15 years 6 months ago
2008
Submodular function minimization is a polynomially-solvable combinatorial problem. Unfortunately the best known general-purpose algorithms have high-order polynomial time complexi...