2446 search results - page 47 / 490 » Choiceless Polynomial Time |
189
click to vote
WADS
2007
Springer
16 years 7 days ago
2007
Springer
The stable marriage problem is a classical matching problem introduced by Gale and Shapley. It is known that for any instance, there exists a solution, and there is a polynomial ti...
142
click to vote
WAOA
2007
Springer
16 years 7 days ago
2007
Springer
In a buyer-supplier game, a special type of assignment game, a distinguished player, called the buyer, wishes to purchase some combinatorial structure. A set of players, called sup...
143
click to vote
ISAAC
2005
Springer
15 years 11 months ago
2005
Springer
Let G = (V, E) be an undirected graph, and let B ⊆ V × V be a collection of vertex pairs. We give an incremental polynomial time algorithm to enumerate all minimal edge sets X ...
155
click to vote
COCOON
1999
Springer
15 years 10 months ago
1999
Springer
Cai and Selman [CS99] defined a modification of Levin’s notion of average polynomial time and proved, for every P-bi-immune language L and every polynomial-time computable dis...
189
click to vote
COLT
1999
Springer
15 years 10 months ago
1999
Springer
We propose a new boosting algorithm. This boosting algorithm is an adaptive version of the boost by majority algorithm and combines bounded goals of the boost by majority algorith...