681 search results - page 53 / 137 » General Polynomial Time Decomposition Algorithms |
109
click to vote
CONCUR
2009
Springer
15 years 7 months ago
2009
Springer
Bisimulation equivalence is decidable in polynomial time for both sequential and commutative normed context-free processes, known as BPA and BPP, respectively. Despite apparent sim...
84
Voted
CORR
2008
Springer
15 years 17 days ago
2008
Springer
Finding the largest clique in random graphs is a well known hard problem. It is known that a random graph G(n, 1/2) almost surely has a clique of size about 2 log n. A simple greed...
104
Voted
MP
2006
15 years 13 days ago
2006
We study two different lot-sizing problems with time windows that have been proposed recently. For the case of production time windows, in which each client specific order must be ...
102
Voted
STOC
1997
ACM
15 years 4 months ago
1997
ACM
Shor has showed how to perform fault tolerant quantum computation when the probability for an error in a qubit or a gate, η, decays with the size of the computation polylogarithmi...
170
click to vote
CP
2011
Springer
14 years 9 days ago
2011
Springer
A Distributed Constraint Optimization Problem (DCOP) is a fundamental problem that can formalize various applications related to multi-agent cooperation. Since it is NP-hard, consi...