passa ai contenuti
The euclidean Traveling Salesman Problem is NP-Complete Anteprima di questo documento
ChiudiAnteprima di questo documento
Stiamo controllando…

The euclidean Traveling Salesman Problem is NP-Complete

Autore: Christos H Papadimitriou
Editore: [Princeton, NJ] 1976
Serie: [Technical report] / [Computer Science Laboratory, Department of Electrical Egineering, Princeton University], 189; Technical report, Computer Science Laboratory, 1966, 189
Edizione/Formato:   Libro a stampa : English
Fonte:Theoretical computer science ; 4.1977
Banca dati:WorldCat
Voto:

(non ancora votato) 0 con commenti - Diventa il primo.

 

Trova una copia in biblioteca

&AllPage.SpinnerRetrieving; Stiamo ricercando le biblioteche che possiedono questo documento…

Dettagli

Tipo documento {1} {2}
Tutti gli autori / Collaboratori: Christos H Papadimitriou
Numero OCLC: 552247805
Descrizione: S. 237 - 244
Titolo della serie: [Technical report] / [Computer Science Laboratory, Department of Electrical Egineering, Princeton University], 189; Technical report, Computer Science Laboratory, 1966, 189
Responsabilità: Christos H. Papadimitriou

Commenti

Commenti degli utenti
Recuperando commenti GoodReads…
Stiamo recuperando commenti DOGObooks

Etichette

Diventa il primo.
Conferma questa richiesta

Potresti aver già richiesto questo documento. Seleziona OK se si vuole procedere comunque con questa richiesta.

Dati collegati


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

Chiudi finestra

Per favore entra in WorldCat 

Non hai un account? Puoi facilmente crearne uno gratuito.