MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for "Complexity of (iterated) dominance." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

5 documents found, showing 1 through 5.

ATOM

Complexity of (Iterated) Dominance
by Vincent Conitzer, Tuomas Sandholm — 2005 — EC'05
…ABSTRACT Complexity of (Iterated) Dominance ∗ Vincent Conitzer Carnegie Mellon University 5000…
Cited by 13 (5 self) – Add To MetaCart

Complexity of Iterated Dominance and a New Definition of Eliminability
by Vincent Conitzer, Tuomas Sandholm — 2004
…Complexity of Iterated Dominance and a New Definition of Eliminability Vincent Conitzer and Tuomas…
Add To MetaCart

On Iterated Dominance, Matrix Elimination, and Matched Paths
by Felix Br — 2008
…-complete, respectively. Keywords: Algorithmic Game Theory, Computational Complexity, Iterated Dominance, Matching 1…
Add To MetaCart

Simple Layout Algorithms to Maintain Network Connectivity under Faults
by Galen H. Sasaki, Ching-fong Su, David Blight — 2000 — 38th Annual Allerton Conference on Communication, Control, and Computing
… that each iteration takes O( |EWDM | |EIP | | V | 2 ) time. The time complexity of an iteration is dominated…
Cited by 7 (0 self) – Add To MetaCart

Optimal Wire and Transistor Sizing for Circuits with Non-Tree Topology
by Lieven Vandenberghe, Stephen Boyd, Abbas El Gamal — 1997 — in Proc. Int. Conf. on Computer Aided Design
… of iterations as constant, and to regard the complexity of an iteration as dominating the overall complexity…
Cited by 18 (6 self) – Add To MetaCart

Showing 1 through 5.

ATOM

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB