메뉴 건너뛰기




Volumn 35, Issue 35, 2002, Pages 7559-7574

Complexity transitions in global algorithms for sparse linear systems over finite fields

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0037031662     PISSN: 03054470     EISSN: None     Source Type: Journal    
DOI: 10.1088/0305-4470/35/35/301     Document Type: Article
Times cited : (14)

References (17)
  • 2
    • 0003897694 scopus 로고
    • Reading, MA: Addison-Wesley
    • Garey M and Johnson D S 1979 Computers and Intractability: A Guide to the Theory of NP-Completeness (San Francisco, CA: Freeman) Papadimitriou C H 1994 Computational Complexity (Reading, MA: Addison-Wesley)
    • (1994) Computational Complexity
    • Papadimitriou, C.H.1
  • 6
    • 0005685497 scopus 로고    scopus 로고
    • Cambridge: Cambridge University Press
    • Kolchin V F 1999 Random Graphs (Cambridge: Cambridge University Press)
    • (1999) Random Graphs
    • Kolchin, V.F.1
  • 13
    • 20244375723 scopus 로고    scopus 로고
    • PhD Thesis SISSA, Trieste, in preparation
    • Leone M 2002 PhD Thesis SISSA, Trieste, in preparation
    • (2002)
    • Leone, M.1
  • 16
    • 20244370075 scopus 로고    scopus 로고
    • 2001 Preprint DM/0106001
    • Schaefer T J 1978 Proc. 10th STOC (San Diego, CA) (New York: ACM) p 216 Creignou N, Daude H and Dubois O 2001 Preprint DM/0106001
    • Creignou, N.1    Daude, H.2    Dubois, O.3


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