Search    Browse

The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for phrase Lemke-Howson algorithm (changed automatically) with no syntactic query expansion in all metadata.

Publication years (Num. hits)
2004 (1) 2006 (1) 2008 (1) 2009 (1)
Publication types (Num. hits)
article(2) inproceedings(2)
Venues (Conferences, Journals, ...)
FOCS(2) CoRR(1) J. ACM(1)
Authors
Shang-Hua Teng(2) Xi Chen(2) Xiaotie Deng(2) Bernhard von Stengel(1) Bruno Codenotti(1) Marino Pagan(1) Rahul Savani(1) Stefano De Rossi(1)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 3 occurrences of 3 keywords
Results
Found 4 publication records. Showing 4 according to the selection in the facets
Hits ?▲ Authors Title Venue Year Link Author keywords
2Xi Chen, Xiaotie Deng, Shang-Hua Teng Settling the complexity of computing two-player Nash equilibria. Search on Bibsonomy J. ACM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Arrow-Debreu market, Brouwer's fixed point, Lemke-Howson algorithm, PPAD-completeness, Sperner's lemma, Nash equilibrium, smoothed analysis, Two-player game
1Bruno Codenotti, Stefano De Rossi, Marino Pagan An experimental analysis of Lemke-Howson algorithm Search on Bibsonomy CoRR The full citation details ... 2008 DBLP  BibTeX  RDF
1Xi Chen, Xiaotie Deng, Shang-Hua Teng Computing Nash Equilibria: Approximation and Smoothed Complexity. Search on Bibsonomy FOCS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Rahul Savani, Bernhard von Stengel Exponentially Many Steps for Finding a Nash Equilibrium in a Bimatrix Game. Search on Bibsonomy FOCS The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #4 of 4 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.