681 search results - page 50 / 137 » General Polynomial Time Decomposition Algorithms |
ECCC
2006
15 years 16 days ago
2006
Attempts at classifying computational problems as polynomial time solvable, NP-complete, or belonging to a higher level in the polynomial hierarchy, face the difficulty of undecid...
107
click to vote
PODC
2010
ACM
15 years 4 months ago
2010
ACM
We introduce Multi-Trials, a new technique for symmetry breaking for distributed algorithms and apply it to various problems in general graphs. For instance, we present three rand...
105
click to vote
STOC
2005
ACM
16 years 25 days ago
2005
ACM
We consider the problem of computing market equilibria and show three results. (i) For exchange economies satisfying weak gross substitutability we analyze a simple discrete versi...
99
Voted
SIGECOM
2006
ACM
15 years 6 months ago
2006
ACM
Graphical games have been proposed as a game-theoretic model of large-scale distributed networks of non-cooperative agents. When the number of players is large, and the underlying...
136
Voted
STACS
1994
Springer
15 years 4 months ago
1994
Springer
The complexity of the simple maxcut problem is investigated for several special classes of graphs. It is shown that this problem is NP-complete when restricted to one of the follo...