DISCLOSURE:
When you click on links to various merchants on this site and make a purchase, this can result in this site earning a commission at no extra cost to you. Affiliate programs and affiliations include, but are not limited to, the eBay Partner Network, Amazon and Alibris.
A bank is a place that will lend you money if you can prove that you don't need it.
ISBN10: 3540643109, ISBN13: 9783540643104, [publisher: Springer] Good condition. A copy that has been read but remains intact. May contain markings such as bookplates, stamps, limited notes and highlighting, or a few light stains. [Frederick, MD, U.S.A.]
ISBN10: 3540643109, ISBN13: 9783540643104, [publisher: Springer] Good condition. A copy that has been read but remains intact. May contain markings such as bookplates, stamps, limited notes and highlighting, or a few light stains. [Frederick, MD, U.S.A.]
Wonder Book - Member ABAA/ILAB via Alibris /Alibris
Good Good condition. A copy that has been read but remains intact. May contain markings such as bookplates, stamps, limited notes and highlighting, or a few light stains.
Springer. Used - Good. Good condition. A copy that has been read but remains intact. May contain markings such as bookplates, stamps, limited notes and highlighting, or a few light stains. Springer ISBN 3540643109 9783540643104 [US]
ISBN10: 3540643109, ISBN13: 9783540643104, [publisher: Springer] Hardcover New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service. [Irving, TX, U.S.A.] [Publication Year: 1999]
Berlin, Heidelberg Springer 1999 1999 ed. Hard cover New. Sewn binding. Cloth over boards. 272 p. Contains: Unspecified. Texts in Theoretical Computer Science. an Eatcs.
Hard Cover. New. New Book; Fast Shipping from UK; Not signed; Not First Edition; The Introduction to Circuit Complexity : A Uniform Approach. ISBN 3540643109 9783540643104 [GB]
Berlin, Heidelberg Springer 1999 1999 ed. Hard cover New. Sewn binding. Cloth over boards. 272 p. Contains: Unspecified. Texts in Theoretical Computer Science. an Eatcs.
ISBN10: 3540643109, ISBN13: 9783540643104, [publisher: Springer Berlin Heidelberg] Hardcover Presents a broad view of the field covering all the fundamentals needed to study current research papers Introduces methods and results out of all main subareas. Extensive discussion of the literature at the end of each chapter Contains new material that ha. [Greven, Germany] [Publication Year: 1999]
Berlin, Heidelberg Springer 1999 1999 ed. Hard cover New. Sewn binding. Cloth over boards. 272 p. Contains: Unspecified. Texts in Theoretical Computer Science. an Eatcs.
Hardback. New. An advanced textbook giving a broad, modern view of the computational complexity theory of boolean circuits, with extensive references, for theoretical computer scientists and mathematicians. ISBN 3540643109 9783540643104 [GB]
ISBN10: 3540643109, ISBN13: 9783540643104, [publisher: Springer Berlin Heidelberg] Hardcover Presents a broad view of the field covering all the fundamentals needed to study current research papers Introduces methods and results out of all main subareas. Extensive discussion of the literature at the end of each chapter Contains new material that ha. [Greven, Germany] [Publication Year: 1999]
ISBN10: 3540643109, ISBN13: 9783540643104, [publisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG] Hardcover This advanced textbook presents a broad view of the computational complexity theory of boolean circuits. It combines the algorithmic and the automata-theoretic approaches, and includes extensive discussion of the literature to facilitate further study. Series: Texts in Theoretical Computer Science: An EATCS Series. Num Pages: 272 pages, biography. BIC Classification: UYA. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly. Dimension: 234 x 156 x 17. Weight in Grams: 1290. . 1999. Hardback. . . . . [Galway, GY, Ireland] [Publication Year: 1999]
ISBN10: 3540643109, ISBN13: 9783540643104, [publisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG] Hardcover This advanced textbook presents a broad view of the computational complexity theory of boolean circuits. It combines the algorithmic and the automata-theoretic approaches, and includes extensive discussion of the literature to facilitate further study. Series: Texts in Theoretical Computer Science: An EATCS Series. Num Pages: 272 pages, biography. BIC Classification: UYA. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly. Dimension: 234 x 156 x 17. Weight in Grams: 1290. . 1999. Hardback. . . . . Books ship from the US and Ireland. [Olney, MD, U.S.A.] [Publication Year: 1999]
Springer. hardcover. New. New. In shrink wrap. Looks like an interesting title! Springer ISBN 3540643109 9783540643104 [US]
DISCLOSURE:
When you click on links to various merchants on this site and make a purchase, this can result in this site earning a commission at no extra cost to you. Affiliate programs and affiliations include, but are not limited to, the eBay Partner Network, Amazon and Alibris.
