Computational Complexity: (Record no. 2279)

MARC details
000 -LEADER
fixed length control field 01817nam a22002057a 4500
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20240625143635.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 240625b |||||||| |||| 00| 0 eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9781316612156 (PB)
041 ## - LANGUAGE CODE
Language code of accompanying material other than librettos eng
082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 511.352
Item number ARO
100 ## - MAIN ENTRY--PERSONAL NAME
Personal name Arora,Sanjeev
245 ## - TITLE STATEMENT
Title Computational Complexity:
Remainder of title A Modern Approach
260 ## - PUBLICATION, DISTRIBUTION, ETC.
Place of publication, distribution, etc. New Delhi
Name of publisher, distributor, etc. Cambridge University Press
Date of publication, distribution, etc. 2021
300 ## - PHYSICAL DESCRIPTION
Page number xxiv,579 P
505 ## - FORMATTED CONTENTS NOTE
Title 0 Notational conventions<br/>PART ONE BASIC COMPLEXITY CLASSES<br/>PART TWO LOWER BOUNDS FOR CONCRETE COMPUTATIONAL MODELS<br/>PART THREE ADVANCED TOPICS<br/>Appendix: Mathematical background<br/>Hints and selected exercises<br/>Main theorems and definitions<br/>Bibliography<br/>Index<br/>Complexity class
520 ## - SUMMARY, ETC.
Summary, etc. This beginning graduate textbook describes both recent achievements and classical results of computational complexity theory. Requiring essentially no background apart from mathematical maturity, the book can be used as a reference for self-study for anyone interested in complexity, including physicists, mathematicians, and other scientists, as well as a textbook for a variety of courses and seminars. More than 300 exercises are included with a selected hint set. The book starts with a broad introduction to the field and progresses to advanced results. Contents include: definition of Turing machines and basic time and space complexity classes, probabilistic algorithms, interactive proofs, cryptography, quantum computation, lower bounds for concrete computational models (decision trees, communication complexity, constant depth, algebraic and monotone circuits, proof complexity), average-case complexity and hardness amplification, derandomization and pseudorandom constructions, and the PCP theorem.
650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Computational complexity
700 ## - ADDED ENTRY--PERSONAL NAME
Personal name Barak,Boaz
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Source of classification or shelving scheme Dewey Decimal Classification
Koha item type Books
952 ## - LOCATION AND ITEM INFORMATION (KOHA)
-- 6645
952 ## - LOCATION AND ITEM INFORMATION (KOHA)
-- 6646
952 ## - LOCATION AND ITEM INFORMATION (KOHA)
-- 6647
Holdings
Withdrawn status Lost status Source of classification or shelving scheme Damaged status Not for loan Home library Current library Date acquired Source of acquisition Cost, normal purchase price Inventory number Total Checkouts Full call number Barcode Date last seen Cost, replacement price Price effective from Currency Koha item type
    Dewey Decimal Classification     IIITDM Kurnool IIITDM Kurnool 25.06.2024 Bombay Books 1012.50 IN 102 DATED 17/06/2024   511.352 ARO 0005752 25.06.2024 1350.00 25.06.2024 INR Books
    Dewey Decimal Classification     IIITDM Kurnool IIITDM Kurnool 25.06.2024 Bombay Books 1012.50 IN 102 DATED 17/06/2024   511.352 ARO 0005753 25.06.2024 1350.00 25.06.2024 INR Books
    Dewey Decimal Classification     IIITDM Kurnool IIITDM Kurnool 25.06.2024 Bombay Books 1012.50 IN 102 DATED 17/06/2024   511.352 ARO 0005754 25.06.2024 1350.00 25.06.2024 INR Books
LIBRARY HOURS
Mon - Sat : 9:00 AM - 5.30 PM
Library will remain closed on public holidays
Contact Us

Librarian
Central Libray
Indian Institute of Information Technology Design and Manufacturing Kurnool
Andhra Pradesh - 518 007

Library Email ID: library@iiitk.ac.in

Copyright @ Central Library | IIITDM Kurnool

Powered by Koha