메뉴 건너뛰기




Volumn 7, Issue 2, 1998, Pages 163-173

Sperner's lemma and Robust machines

Author keywords

Robust Turing machines; Sperner's lemma

Indexed keywords


EID: 0032350735     PISSN: 10163328     EISSN: None     Source Type: Journal    
DOI: 10.1007/s000370050008     Document Type: Article
Times cited : (14)

References (14)
  • 2
    • 0003979954 scopus 로고
    • Technical Report Technical Report 88-04, Johns Hopkins Department of Computer Science
    • R. BEIGEL, NP-hard sets are P-superterse unless R=NP. Technical Report Technical Report 88-04, Johns Hopkins Department of Computer Science, 1988.
    • (1988) NP-hard Sets are P-superterse unless R=NP
    • Beigel, R.1
  • 3
    • 34250967150 scopus 로고
    • Über abbildungen von Mannigfaltigkeiten
    • L.E. J. BROUWER, Über Abbildungen von Mannigfaltigkeiten. Mathematische Annalen 71 (1912), 97-115.
    • (1912) Mathematische Annalen , vol.71 , pp. 97-115
    • Brouwer, L.E.J.1
  • 7
    • 38249025245 scopus 로고
    • Exponential lower bounds for finding Brouwer's fixed points
    • M.D. HIRSCH, C.H. PAPADIMITRIOU, AND S. VAVASIS, Exponential lower bounds for finding Brouwer's fixed points. J. Complexity 5 (1989), 379-416.
    • (1989) J. Complexity , vol.5 , pp. 379-416
    • Hirsch, M.D.1    Papadimitriou, C.H.2    Vavasis, S.3
  • 9
    • 0026142122 scopus 로고
    • On total functions, existence theorems and computational complexity
    • N. MEGIDDO AND C.H. PAPADIMITRIOU, On total functions, existence theorems and computational complexity. Theoretical Computer Science 81 (1991), 317-324.
    • (1991) Theoretical Computer Science , vol.81 , pp. 317-324
    • Megiddo, N.1    Papadimitriou, C.H.2
  • 11
    • 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. Journal of Computer and System Science 48 (1994), 498-532.
    • (1994) Journal of Computer and System Science , vol.48 , pp. 498-532
    • Papadimitriou, C.H.1
  • 12
    • 0021482941 scopus 로고
    • Robust algorithms: A different approach to oracles
    • U. SCHÖNING, Robust algorithms: a different approach to oracles. Theoretical Computer Science 40 (1985), 57-66.
    • (1985) Theoretical Computer Science , vol.40 , pp. 57-66
    • Schöning, U.1
  • 14
    • 0000549502 scopus 로고
    • Neuer Beweis für die Invarianz der Dimensionszahl und des Gebietes
    • E. SPERNER, Neuer Beweis für die Invarianz der Dimensionszahl und des Gebietes. Abh. Math. Sem. Hamburg. Univ. 6 (1928), 265-272.
    • (1928) Abh. Math. Sem. Hamburg. Univ. , vol.6 , pp. 265-272
    • Sperner, E.1


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