Complexity Theory Exploring the Limits of Efficient Algorithms

Complexity theory is the theory of determining the necessary resources for the solution of algorithmic problems and, therefore, the limits of what is possible with the available resources. An understanding of these limits prevents the search for non-existing efficient algorithms. This textbook consi...

Full description

Saved in:
Bibliographic Details
Main Author Wegener, Ingo
Format eBook Book
LanguageEnglish
Published Berlin, Heidelberg Springer Nature 2005
Springer
Springer Berlin Heidelberg
Edition1
Subjects
Algorithm Analysis and Problem Complexity
Algorithms
Coding and Information Theory
Computer programming, programs, data
Computer Science
Logics and Meanings of Programs
Mathematical Logic and Formal Languages
Programming Techniques
Online AccessGet full text

Cover

Abstract Complexity theory is the theory of determining the necessary resources for the solution of algorithmic problems and, therefore, the limits of what is possible with the available resources. An understanding of these limits prevents the search for non-existing efficient algorithms. This textbook considers randomization as a key concept and emphasizes the interplay between theory and practice: New branches of complexity theory continue to arise in response to new algorithmic concepts, and its results- such as the theory of NP-completeness- have influenced the development of all areas of computer science. The topics selected have implications for concrete applications, and the significance of complexity theory for today's computer science is stressed throughout.
AbstractList Complexity theory is the theory of determining the necessary resources for the solution of algorithmic problems and, therefore, the limits of what is possible with the available resources. An understanding of these limits prevents the search for non-existing efficient algorithms. This textbook considers randomization as a key concept and emphasizes the interplay between theory and practice: New branches of complexity theory continue to arise in response to new algorithmic concepts, and its results- such as the theory of NP-completeness- have influenced the development of all areas of computer science. The topics selected have implications for concrete applications, and the significance of complexity theory for today's computer science is stressed throughout.
Author Wegener, Ingo
Author_xml – sequence: 1
  fullname: Wegener, Ingo
BackLink https://cir.nii.ac.jp/crid/1130000795810559488$$DView record in CiNii
BookMark eNpd0EtLAzEQB_CIVmxrDx68iwgisppk8jzqUh9Q8FK8hnSbbdduN-tmffTbm3a9aA4JGX7MMP8BOqh85RA6JfiGYCxvIeEMJ1QyKRO2h0ZaKoiVXQH2__17aEAx5ppiDvgQ9amgQkqpyBEahfCG4wEiJIM-Okn9ui7dd9FuzqZL55vNMerltgxu9PsO0evDeJo-JZOXx-f0bpJYzrjiSaalmCuYM6Iwz3M9Z1QwLUECp06JTHEmMZspDjSXRCuBrQJs41RGGYgZDNFV19iGlfsKS1-2wXyWbub9Kpg_C0V73dlQN0W1cI3pFMFmG48BE63ZYcOivux03fj3Dxdas2uauaptbGnG96kAQinBUV50sioKkxXbmxDYBiQ1VwRzrplSkZ13LLPBlpGZta_8orH1MhgeF4ppwg-pTXEe
ContentType eBook
Book
Copyright Springer-Verlag Berlin Heidelberg 2005
Copyright_xml – notice: Springer-Verlag Berlin Heidelberg 2005
DBID I4C
RYH
DEWEY 005
DOI 10.1007/3-540-27477-4
DatabaseName Casalini Torrossa eBooks Institutional Catalogue
CiNii Complete
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Mathematics
Computer Science
DocumentTitleAlternate Grenzen der Effizienz von Algorithmen
EISBN 9783540274773
3540274774
Edition 1
Editor Wegener, Ingo
Editor_xml – sequence: 1
  fullname: Wegener, Ingo
ExternalDocumentID 9783540274773
71237
EBC6312210
BA71828509
5342167
GroupedDBID -T.
0D6
0DA
0E8
38.
64P
6NX
8V7
AABBV
AABSQ
AAIER
AAJYQ
AATVQ
AAUKK
ABBRO
ABBUY
ABCYT
ABMNI
ADVHH
AEHEY
AEJLV
AEKFX
AETDV
AEVYL
AEZAY
AFUVA
ALMA_UNASSIGNED_HOLDINGS
ATJMZ
BBABE
CZZ
E6I
I4C
IEZ
LTD
NUD
SBO
SUFPE
SVJCK
TPJZQ
UR3
Z83
Z84
Z88
ACDTA
ACDUY
AHNNE
RYH
ID FETCH-LOGICAL-a54585-c976d83d41805ff9d42649737352e86c854704b8532f719860a830a74342436b3
ISBN 9783540274773
3540274774
3540210458
9783540210450
IngestDate Wed Jun 18 05:29:36 EDT 2025
Tue Jul 29 20:14:28 EDT 2025
Fri May 30 21:14:12 EDT 2025
Fri Jun 27 00:17:53 EDT 2025
Wed Jun 18 05:43:44 EDT 2025
IsPeerReviewed false
IsScholarly false
LCCN 2005920530
LCCallNum_Ident Q
Language English
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-a54585-c976d83d41805ff9d42649737352e86c854704b8532f719860a830a74342436b3
Notes Includes bibliographical references (p. [295]-299) and index
Translation of: Komplexitätstheorie - Grenzen der Effizienz von Algorithmen
OCLC 262677781
PQID EBC6312210
PageCount 307
ParticipantIDs askewsholts_vlebooks_9783540274773
springer_books_10_1007_3_540_27477_4
proquest_ebookcentral_EBC6312210
nii_cinii_1130000795810559488
casalini_monographs_5342167
PublicationCentury 2000
PublicationDate 2005
c2005
2006-01-15
PublicationDateYYYYMMDD 2005-01-01
2006-01-15
PublicationDate_xml – year: 2005
  text: 2005
PublicationDecade 2000
PublicationPlace Berlin, Heidelberg
PublicationPlace_xml – name: Netherlands
– name: Berlin
– name: Berlin, Heidelberg
PublicationYear 2005
2006
Publisher Springer Nature
Springer
Springer Berlin Heidelberg
Publisher_xml – name: Springer Nature
– name: Springer
– name: Springer Berlin Heidelberg
SSID ssj0000316743
Score 2.3807578
Snippet Complexity theory is the theory of determining the necessary resources for the solution of algorithmic problems and, therefore, the limits of what is possible...
SourceID askewsholts
springer
proquest
nii
casalini
SourceType Aggregation Database
Publisher
SubjectTerms Algorithm Analysis and Problem Complexity
Algorithms
Coding and Information Theory
Computer programming, programs, data
Computer Science
Logics and Meanings of Programs
Mathematical Logic and Formal Languages
Programming Techniques
Subtitle Exploring the Limits of Efficient Algorithms
Title Complexity Theory
URI http://digital.casalini.it/9783540274773
https://cir.nii.ac.jp/crid/1130000795810559488
https://ebookcentral.proquest.com/lib/[SITE_ID]/detail.action?docID=6312210
http://link.springer.com/10.1007/3-540-27477-4
https://www.vlebooks.com/vleweb/product/openreader?id=none&isbn=9783540274773
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1Rb9MwELagCIm-AANENoYstDeUKYmdxOGJbSoaFeMBjbE3K3HtUhFSackm4NdzZycuKUgIXqzWinzRfcnl7nzfmZCDKokXKlEmTHhpQp7h_m7GWChYpYxJCsUsfezsfXb6kc8v08vNkYaWXdJVh-rHH3kl_4MqzAGuyJL9B2T9ojABvwFfGAFhGLecX_-37ymAheD6G3rQlon43Ub22tfToTdZI3XJFmpo2ybCFpPXS7ig-_zVe9Kf9FL3nJe3zXLtLeXVtTtm-QNmGur65fxwlB9It_IDQ35wFDdisgdiPe56vv5mRV3hhCuawKg174k448bUx0fwXUtEivTJ23kOJuXO0Wz-7sKnuCJmKQ49o8bKE3d9ssnJ79ueIptxJG9KpmX7Bew8fAO6Fp2Gsi2RKwo-QLNajeKBrS1s6xmcPyATZIs8JLd0s0PuD2dk0N5k7pDpme-L2z4irzfAUQccfUU9bDhFHWx0baiHjW5ge0wu3szOT07D_gyLsMQtyTRU4O8tBFvwWESpMcUCXdAiZzm8BFpkSqQ8j3gFXlNi8rgQWVQKFpWgN55wllXsCZk060Y_JTTWVQbRp2JGlBwWAjWqKtMq0kwnpioC8uIXncmb2u63t3JQOGqWBWRvUKWE18H1RW9lCuIArYDsg3alWuEY41YnIFOkAo9RLcDWB4QOepd29b6EWM6OTzIWJwBqQA4GPKSTP3TGZhLuQtrbkHz3L5L2yL3N0_yMTLqra70P_l9XPe-fs598RE0P
linkProvider Library Specific Holdings
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=book&rft.title=Complexity+theory+%3A+exploring+the+limits+of+efficient+algorithms&rft.au=Wegener%2C+Ingo&rft.au=Pruim%2C+Randall+J.&rft.date=2005-01-01&rft.pub=Springer&rft.isbn=9783540210450&rft_id=info:doi/10.1007%2F3-540-27477-4&rft.externalDocID=BA71828509
thumbnail_m http://utb.summon.serialssolutions.com/2.0.0/image/custom?url=https%3A%2F%2Fvle.dmmserver.com%2Fmedia%2F640%2F97835402%2F9783540274773.jpg
thumbnail_s http://utb.summon.serialssolutions.com/2.0.0/image/custom?url=https%3A%2F%2Fmedia.springernature.com%2Fw306%2Fspringer-static%2Fcover-hires%2Fbook%2F978-3-540-27477-3