9842 search results - page 1424 / 1969 » The Complexity of the Matching-Cut Problem |
188
click to vote
SODA
2010
ACM
16 years 4 months ago
2010
ACM
We study the computational complexity of some central analysis problems for One-Counter Markov Decision Processes (OC-MDPs), a class of finitely-presented, countable-state MDPs. O...
183
click to vote
STACS
2010
Springer
16 years 2 months ago
2010
Springer
Kabanets and Impagliazzo [KI04] show how to decide the circuit polynomial identity testing problem (CPIT) in deterministic subexponential time, assuming hardness of some explicit ...
176
click to vote
CIKM
2009
Springer
16 years 1 months ago
2009
Springer
We introduce a new theoretical derivation, evaluation methods, and extensive empirical analysis for an automatic query expansion framework in which model estimation is cast as a r...
207
click to vote
ATAL
2007
Springer
16 years 1 months ago
2007
Springer
Distributed Constraint Optimization (DCOP) is a general framework that can model complex problems in multi-agent systems. Several current algorithms that solve general DCOP instan...
180
click to vote
COCO
2007
Springer
16 years 1 months ago
2007
Springer
We consider the k-layer pointer jumping problem in the one-way multi-party number-on-the-forehead communication model. Sufficiently strong lower bounds for the problem would have...