pular para conteúdo
The euclidean Traveling Salesman Problem is NP-Complete Ver prévia deste item
FecharVer prévia deste item
Checando...

The euclidean Traveling Salesman Problem is NP-Complete

Autor: Christos H Papadimitriou
Editora: [Princeton, NJ] 1976
Séries: [Technical report] / [Computer Science Laboratory, Department of Electrical Egineering, Princeton University], 189; Technical report, Computer Science Laboratory, 1966, 189
Edição/Formato   Print book : Inglês
Publicação:Theoretical computer science ; 4.1977
Base de Dados:WorldCat
Classificação:

(ainda não classificado) 0 com críticas - Seja o primeiro.

 

Encontrar uma cópia na biblioteca

&AllPage.SpinnerRetrieving; Encontrando bibliotecas que possuem este item...

Detalhes

Tipo de Documento: Livro
Todos os Autores / Contribuintes: Christos H Papadimitriou
Número OCLC: 552247805
Descrição: S. 237 - 244
Título da Série: [Technical report] / [Computer Science Laboratory, Department of Electrical Egineering, Princeton University], 189; Technical report, Computer Science Laboratory, 1966, 189
Responsabilidade: Christos H. Papadimitriou

Críticas

Críticas contribuídas por usuários
Recuperando críticas GoodReas...
Recuperando comentários DOGObooks

Etiquetas

Seja o primeiro.
Confirmar esta solicitação

Você já pode ter solicitado este item. Por favor, selecione Ok se gostaria de proceder com esta solicitação de qualquer forma.

Dados Ligados


Primary Entity

<http://www.worldcat.org/oclc/552247805> # The euclidean Traveling Salesman Problem is NP-Complete
    a schema:Book, schema:CreativeWork ;
   library:oclcnum "552247805" ;
   library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/423708601#Place/princeton_nj> ; # Princeton, NJ
   library:placeOfPublication <http://id.loc.gov/vocabulary/countries/xxu> ;
   schema:bookFormat bgn:PrintBook ;
   schema:creator <http://experiment.worldcat.org/entity/work/data/423708601#Person/papadimitriou_christos_h> ; # Christos H. Papadimitriou
   schema:datePublished "1976" ;
   schema:exampleOfWork <http://worldcat.org/entity/work/id/423708601> ;
   schema:inLanguage "en" ;
   schema:isPartOf <http://experiment.worldcat.org/entity/work/data/423708601#Series/technical_report> ; # Technical report
   schema:isPartOf <http://experiment.worldcat.org/entity/work/data/423708601#Series/technical_report_computer_science_laboratory_department_of_electrical_egineering_princeton_university> ; # [Technical report] / [Computer Science Laboratory, Department of Electrical Egineering, Princeton University]
   schema:name "The euclidean Traveling Salesman Problem is NP-Complete" ;
   schema:productID "552247805" ;
   schema:publication <http://www.worldcat.org/title/-/oclc/552247805#PublicationEvent/princeton_nj1976> ;
   wdrs:describedby <http://www.worldcat.org/title/-/oclc/552247805> ;
    .


Related Entities

<http://experiment.worldcat.org/entity/work/data/423708601#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/423708601#Series/technical_report> # Technical report
    a bgn:PublicationSeries ;
   schema:hasPart <http://www.worldcat.org/oclc/552247805> ; # The euclidean Traveling Salesman Problem is NP-Complete
   schema:name "Technical report" ;
    .

<http://experiment.worldcat.org/entity/work/data/423708601#Series/technical_report_computer_science_laboratory_department_of_electrical_egineering_princeton_university> # [Technical report] / [Computer Science Laboratory, Department of Electrical Egineering, Princeton University]
    a bgn:PublicationSeries ;
   schema:hasPart <http://www.worldcat.org/oclc/552247805> ; # The euclidean Traveling Salesman Problem is NP-Complete
   schema:name "[Technical report] / [Computer Science Laboratory, Department of Electrical Egineering, Princeton University]" ;
    .


Content-negotiable representations

Close Window

Por favor, conecte-se ao WorldCat 

Não tem uma conta? Você pode facilmente criar uma conta gratuita.