skip to content
Algorithms Preview this item
ClosePreview this item
Checking...

Algorithms

Author: Παπαδημητρίου, Χρίστος Χ. ; Sanjoy Dasgupta; Christos H Papadimitriou; Umesh Virkumar Vazirani
Publisher: Boston : McGraw-Hill Higher Education, ©2008.
Edition/Format:   Print book : EnglishView all editions and formats
Summary:
This text, extensively class-tested over a decade at UC Berkeley and UC San Diego, explains the fundamentals of algorithms in a story line that makes the material enjoyable and easy to digest. Emphasis is placed on understanding the crisp mathematical idea behind each algorithm, in a manner that is intuitive and rigorous without being unduly formal. Features include:The use of boxes to strengthen the narrative:  Read more...
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

Find a copy online

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Genre/Form: Lehrbuch
Textbooks
Material Type: Internet resource
Document Type: Book, Internet Resource
All Authors / Contributors: Παπαδημητρίου, Χρίστος Χ. ; Sanjoy Dasgupta; Christos H Papadimitriou; Umesh Virkumar Vazirani
ISBN: 9780073523408 0073523402
OCLC Number: 70267221
Description: x, 320 pages : illustrations ; 24 cm
Contents: Prologue --
Algorithms with numbers --
Divide-and conquer algorithms --
Decompositions of graphs --
Paths in graphs --
Greedy algorithms --
Dynamic programming --
Linear programming and reductions --
NP-complete problems --
Coping with NP-completeness --
Quantum algorithms.
Responsibility: Sanjoy Dasgupta, Christos Papadimitriou, Umesh Vazirani.
More information:

Abstract:

Explaining the fundamentals of algorithms, this text emphasizes on understanding the mathematical idea behind each algorithm. It includes features such as: the use of boxes to strengthen the  Read more...

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.

Similar Items

Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


Primary Entity

<http://www.worldcat.org/oclc/70267221> # Algorithms
    a schema:CreativeWork, schema:Book ;
    library:oclcnum "70267221" ;
    library:placeOfPublication <http://id.loc.gov/vocabulary/countries/mau> ;
    library:placeOfPublication <http://dbpedia.org/resource/Boston> ; # Boston
    schema:about <http://experiment.worldcat.org/entity/work/data/57478643#Topic/algorithmus> ; # Algorithmus
    schema:about <http://id.loc.gov/authorities/subjects/sh91000149> ; # Computer algorithms
    schema:about <http://experiment.worldcat.org/entity/work/data/57478643#Topic/algoritmos_e_estruturas_de_dados> ; # Algoritmos e estruturas de dados
    schema:about <http://id.loc.gov/authorities/subjects/sh85003487> ; # Algorithms
    schema:about <http://id.worldcat.org/fast/805020> ; # Algorithms
    schema:about <http://experiment.worldcat.org/entity/work/data/57478643#Topic/datoralgoritmer> ; # Datoralgoritmer
    schema:about <http://dewey.info/class/518.1/e22/> ;
    schema:about <http://id.worldcat.org/fast/872010> ; # Computer algorithms
    schema:bookFormat bgn:PrintBook ;
    schema:contributor <http://viaf.org/viaf/37023528> ; # Umesh Virkumar Vazirani
    schema:contributor <http://viaf.org/viaf/37007186> ; # Χρίστος Χ. Παπαδημητρίου
    schema:copyrightYear "2008" ;
    schema:creator <http://viaf.org/viaf/36345823> ; # Sanjoy Dasgupta
    schema:datePublished "2008" ;
    schema:description "Prologue -- Algorithms with numbers -- Divide-and conquer algorithms -- Decompositions of graphs -- Paths in graphs -- Greedy algorithms -- Dynamic programming -- Linear programming and reductions -- NP-complete problems -- Coping with NP-completeness -- Quantum algorithms."@en ;
    schema:description "This text, extensively class-tested over a decade at UC Berkeley and UC San Diego, explains the fundamentals of algorithms in a story line that makes the material enjoyable and easy to digest. Emphasis is placed on understanding the crisp mathematical idea behind each algorithm, in a manner that is intuitive and rigorous without being unduly formal. Features include:The use of boxes to strengthen the narrative: pieces that provide historical context, descriptions of how the algorithms are used in practice, and excursions for the mathematically sophisticated. Carefully chosen advanced topics that can be skipped in a standard one-semester course, but can be covered in an advanced algorithms course or in a more leisurely two-semester sequence. An accessible treatment of linear programming introduces students to one of the greatest achievements in algorithms. An optional chapter on the quantum algorithm for factoring provides a unique peephole into this exciting topic. In addition to the text, DasGupta also offers a Solutions Manual, which is available on the Online Learning Center. "Algorithms is an outstanding undergraduate text, equally informed by the historical roots and contemporary applications of its subject. Like a captivating novel, it is a joy to read." Tim Roughgarden Stanford University."@en ;
    schema:exampleOfWork <http://worldcat.org/entity/work/id/57478643> ;
    schema:genre "Textbooks"@en ;
    schema:genre "Lehrbuch"@en ;
    schema:inLanguage "en" ;
    schema:name "Algorithms"@en ;
    schema:productID "70267221" ;
    schema:publication <http://www.worldcat.org/title/-/oclc/70267221#PublicationEvent/boston_mcgraw_hill_higher_education_2008> ;
    schema:publisher <http://experiment.worldcat.org/entity/work/data/57478643#Agent/mcgraw_hill_higher_education> ; # McGraw-Hill Higher Education
    schema:url <http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=015630767&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA> ;
    schema:url <http://catdir.loc.gov/catdir/enhancements/fy0665/2006049014-t.html> ;
    schema:url <http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&doc_number=015630767&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA> ;
    schema:workExample <http://worldcat.org/isbn/9780073523408> ;
    wdrs:describedby <http://www.worldcat.org/title/-/oclc/70267221> ;
    .


Related Entities

<http://dbpedia.org/resource/Boston> # Boston
    a schema:Place ;
    schema:name "Boston" ;
    .

<http://experiment.worldcat.org/entity/work/data/57478643#Agent/mcgraw_hill_higher_education> # McGraw-Hill Higher Education
    a bgn:Agent ;
    schema:name "McGraw-Hill Higher Education" ;
    .

<http://experiment.worldcat.org/entity/work/data/57478643#Topic/algoritmos_e_estruturas_de_dados> # Algoritmos e estruturas de dados
    a schema:Intangible ;
    schema:name "Algoritmos e estruturas de dados"@en ;
    .

<http://id.loc.gov/authorities/subjects/sh85003487> # Algorithms
    a schema:Intangible ;
    schema:name "Algorithms"@en ;
    .

<http://id.loc.gov/authorities/subjects/sh91000149> # Computer algorithms
    a schema:Intangible ;
    schema:name "Computer algorithms"@en ;
    .

<http://id.worldcat.org/fast/805020> # Algorithms
    a schema:Intangible ;
    schema:name "Algorithms"@en ;
    .

<http://id.worldcat.org/fast/872010> # Computer algorithms
    a schema:Intangible ;
    schema:name "Computer algorithms"@en ;
    .

<http://viaf.org/viaf/36345823> # Sanjoy Dasgupta
    a schema:Person ;
    schema:familyName "Dasgupta" ;
    schema:givenName "Sanjoy" ;
    schema:name "Sanjoy Dasgupta" ;
    .

<http://viaf.org/viaf/37007186> # Χρίστος Χ. Παπαδημητρίου
    a schema:Person ;
    schema:familyName "Papadimitriou" ;
    schema:givenName "Christos H." ;
    schema:name "Χρίστος Χ. Παπαδημητρίου"@en ;
    schema:name "Christos H. Papadimitriou"@en ;
    .

<http://viaf.org/viaf/37023528> # Umesh Virkumar Vazirani
    a schema:Person ;
    schema:familyName "Vazirani" ;
    schema:givenName "Umesh Virkumar" ;
    schema:name "Umesh Virkumar Vazirani" ;
    .

<http://worldcat.org/isbn/9780073523408>
    a schema:ProductModel ;
    schema:isbn "0073523402" ;
    schema:isbn "9780073523408" ;
    .


Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.