메뉴 건너뛰기




Volumn 4051 LNCS, Issue , 2006, Pages 489-500

On the complexity of 2D discrete fixed point problem

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER AIDED SOFTWARE ENGINEERING; GRAPHIC METHODS;

EID: 33746330137     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11786986_43     Document Type: Conference Paper
Times cited : (27)

References (11)
  • 1
    • 34848910771 scopus 로고    scopus 로고
    • On algorithms for discrete and approximate brouwer fixed points
    • X. Chen and X. Deng. On Algorithms for Discrete and Approximate Brouwer Fixed Points. In STOC 2005, pages 323-330.
    • STOC 2005 , pp. 323-330
    • Chen, X.1    Deng, X.2
  • 2
    • 84941157707 scopus 로고    scopus 로고
    • On the complexity of 2D discrete fixed point problem
    • X. Chen and X. Deng. On the Complexity of 2D Discrete Fixed Point Problem. ECCC, TR06-037, 2006.
    • (2006) ECCC , vol.TR06-037
    • Chen, X.1    Deng, X.2
  • 3
    • 38749097207 scopus 로고    scopus 로고
    • Computing nash equilibria: Approximation and smoothed complexity
    • X. Chen, X. Deng, and S.-H. Teng. Computing Nash equilibria: approximation and smoothed complexity. ECCC, TR06-023, 2006.
    • (2006) ECCC , vol.TR06-023
    • Chen, X.1    Deng, X.2    Teng, S.-H.3
  • 7
    • 0035276977 scopus 로고    scopus 로고
    • A Sperner lemma complete for PPA
    • M. Grigni. A Sperner lemma complete for PPA. Inform. Process. Lett., 77(5-6):255-259, 2001.
    • (2001) Inform. Process. Lett. , vol.77 , Issue.5-6 , pp. 255-259
    • Grigni, M.1
  • 8
    • 38249025245 scopus 로고
    • Exponential lower bounds for finding brouwer fixed points
    • M.D. Hirsch, C. Papadimitriou and S. Vavasis. Exponential lower bounds for finding Brouwer fixed points. J.Complexity, 5:379-416, 1989.
    • (1989) J.Complexity , vol.5 , pp. 379-416
    • Hirsch, M.D.1    Papadimitriou, C.2    Vavasis, S.3
  • 10
    • 0028459906 scopus 로고
    • On the complexity of the parity argument and other inefficient proofs of existence
    • C.H. Papadimitriou. On the complexity of the parity argument and other inefficient proofs of existence. JCSS, pages 498-532, 1994.
    • (1994) JCSS , pp. 498-532
    • Papadimitriou, C.H.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.