컨텐츠로 이동
Computational complexity 해당 항목을 미리보기
닫기해당 항목을 미리보기
확인중입니다…

Computational complexity

저자: Christos H Papadimitriou
출판사: Reading, Mass. : Addison-Wesley, ©1994.
판/형식:   Print book : 영어모든 판과 형식 보기
데이터베이스:WorldCat
요약:

Offers a comprehensive treatment of the theory of algorithms and complexity. Among topics covered are: reductions and NP - completeness, cryptography and protocols, randomized algorithms, and  더 읽기…

평가:

(아무런 평가가 없습니다.) 0 리뷰와 함께 - 첫번째로 올려주세요.

주제
다음과 같습니다:

 

온라인으로 문서 찾기

이 항목에 대한 링크

도서관에서 사본 찾기

&AllPage.SpinnerRetrieving; 해당항목을 보유하고 있는 도서관을 찾는 중

상세정보

추가적인 물리적 형식: Online version:
Papadimitriou, Christos H.
Computational complexity.
Reading, Mass. : Addison-Wesley, ©1994
(OCoLC)654178169
자료 유형: 인터넷 자료
문서 형식: 책, 인터넷 자원
모든 저자 / 참여자: Christos H Papadimitriou
ISBN: 0201530821 9780201530827 0020153082 9780020153085
OCLC 번호: 28421912
설명: xv, 523 pages : illustrations ; 25 cm
내용: pt. I. Algorithms. 1. Problems and Algorithms. 2. Turing machines. 3. Computability --
pt. II. Logic. 4. Boolean logic. 5. First-order logic. 6. Undecidability in logic --
pt. III. P and NP. 7. Relations between complexity classes. 8. Reductions and completeness. 9. NP-complete problems. 10. coNP and function problems. 11. Randomized computation. 12. Cryptography. 13. Approximability. 14. On P vs. NP --
pt. IV. Inside P. 15. Parallel computation. 16. Logarithmic space --
pt. V. Beyond NP. 17. The polynomial hierarchy. 18. Computation that counts. 19. Polynomial space. 20. A glimpse beyond.
책임: Christos H. Papadimitriou.
더 많은 정보:

리뷰

사용자-기여 리뷰
GoodReads 리뷰 가져오는 중…
DOGObooks 리뷰를 가지고 오는 중…

태그

첫번째 되기

유사 항목

관련 주제:(4)

이 항목을 가지고 있는 사용자 목록 (1)

요청하신 것을 확인하기

이 항목을 이미 요청하셨을 수도 있습니다. 만약 이 요청을 계속해서 진행하시려면 Ok을 선택하세요.

링크된 데이터


Primary Entity

<http://www.worldcat.org/oclc/28421912> # Computational complexity
    a schema:Book, schema:CreativeWork ;
   library:oclcnum "28421912" ;
   library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/30840215#Place/reading_mass> ; # Reading, Mass.
   library:placeOfPublication <http://id.loc.gov/vocabulary/countries/mau> ;
   schema:about <http://experiment.worldcat.org/entity/work/data/30840215#Topic/algoritmen> ; # Algoritmen
   schema:about <http://dewey.info/class/511.3/e20/> ;
   schema:about <http://experiment.worldcat.org/entity/work/data/30840215#Topic/computational_complexity> ; # Computational complexity
   schema:about <http://id.worldcat.org/fast/871991> ; # Computational complexity
   schema:about <http://experiment.worldcat.org/entity/work/data/30840215#Topic/complexiteit> ; # Complexiteit
   schema:bookFormat bgn:PrintBook ;
   schema:copyrightYear "1994" ;
   schema:creator <http://experiment.worldcat.org/entity/work/data/30840215#Person/papadimitriou_christos_h> ; # Christos H. Papadimitriou
   schema:datePublished "1994" ;
   schema:description "pt. I. Algorithms. 1. Problems and Algorithms. 2. Turing machines. 3. Computability -- pt. II. Logic. 4. Boolean logic. 5. First-order logic. 6. Undecidability in logic -- pt. III. P and NP. 7. Relations between complexity classes. 8. Reductions and completeness. 9. NP-complete problems. 10. coNP and function problems. 11. Randomized computation. 12. Cryptography. 13. Approximability. 14. On P vs. NP -- pt. IV. Inside P. 15. Parallel computation. 16. Logarithmic space -- pt. V. Beyond NP. 17. The polynomial hierarchy. 18. Computation that counts. 19. Polynomial space. 20. A glimpse beyond."@en ;
   schema:exampleOfWork <http://worldcat.org/entity/work/id/30840215> ;
   schema:inLanguage "en" ;
   schema:isSimilarTo <http://www.worldcat.org/oclc/654178169> ;
   schema:name "Computational complexity"@en ;
   schema:productID "28421912" ;
   schema:publication <http://www.worldcat.org/title/-/oclc/28421912#PublicationEvent/reading_mass_addison_wesley_1994> ;
   schema:publisher <http://experiment.worldcat.org/entity/work/data/30840215#Agent/addison_wesley> ; # Addison-Wesley
   schema:url <http://www.gbv.de/dms/ilmenau/toc/12708035X.PDF> ;
   schema:workExample <http://worldcat.org/isbn/9780201530827> ;
   schema:workExample <http://worldcat.org/isbn/9780020153085> ;
   wdrs:describedby <http://www.worldcat.org/title/-/oclc/28421912> ;
    .


Related Entities

<http://experiment.worldcat.org/entity/work/data/30840215#Agent/addison_wesley> # Addison-Wesley
    a bgn:Agent ;
   schema:name "Addison-Wesley" ;
    .

<http://experiment.worldcat.org/entity/work/data/30840215#Person/papadimitriou_christos_h> # Christos H. Papadimitriou
    a schema:Person ;
   schema:familyName "Papadimitriou" ;
   schema:givenName "Christos H." ;
   schema:name "Christos H. Papadimitriou" ;
    .

<http://experiment.worldcat.org/entity/work/data/30840215#Topic/computational_complexity> # Computational complexity
    a schema:Intangible ;
   schema:name "Computational complexity"@en ;
    .

<http://id.worldcat.org/fast/871991> # Computational complexity
    a schema:Intangible ;
   schema:name "Computational complexity"@en ;
    .

<http://worldcat.org/isbn/9780020153085>
    a schema:ProductModel ;
   schema:isbn "0020153082" ;
   schema:isbn "9780020153085" ;
    .

<http://worldcat.org/isbn/9780201530827>
    a schema:ProductModel ;
   schema:isbn "0201530821" ;
   schema:isbn "9780201530827" ;
    .

<http://www.worldcat.org/oclc/654178169>
    a schema:CreativeWork ;
   rdfs:label "Computational complexity." ;
   schema:description "Online version:" ;
   schema:isSimilarTo <http://www.worldcat.org/oclc/28421912> ; # Computational complexity
    .


Content-negotiable representations

윈도우 닫기

WorldCat에 로그인 하십시오 

계정이 없으세요? 아주 간단한 절차를 통하여 무료 계정을 만드실 수 있습니다.