Springer , pp. 620 . Hardback. New. Springer ISBN 3540594361 9783540594369 [US]

ISBN10: 3540594361, ISBN13: 9783540594369, [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: 2002]

ISBN10: 3540594361, ISBN13: 9783540594369, [publisher: Springer] Hardcover Springer, Berlin, 2002. XIV, 601 pages with many graphics, hard cover, (stamp on intent)--- 1055 Gramm.
[Eicklingen, Germany] [Publication Year: 2002]
Show/Hide image

Springer, Date: 2002. 1st. Hardcover. New/New. 2002. Springer ISBN 3540594361 9783540594369 [IN]

Springer 2002-09-19 2002 ed. Hardcover New Size: 9x6x0; New. In shrink wrap. Looks like an interesting title!

Springer, Date: 2002-09-19. Hardcover. New. New. In shrink wrap. Looks like an interesting title! 2002. Springer ISBN 3540594361 9783540594369 [US]

Hard Cover. New. New Book; Fast Shipping from UK; Not signed; Not First Edition; The Boolean Functions and Computation Models. ISBN 3540594361 9783540594369 [GB]

New. The two internationally renowned authors elucidate the structure of "fast" parallel computation. Its complexity is emphasised through a variety of techniques ranging from finite combinatorics, probability theory and finite group theory to finite model theory and proof theory. Non-uniform computation models are studied in the form of Boolean circuits; uniform ones in a variety of forms. Steps in the investigation of non-deterministic polynomial time are surveyed as is the complexity of various proof systems. Providing a survey of research in the field, the book will benefit advanced undergraduates and graduate students as well as researchers. ISBN 3540594361 9783540594369 [GB]

Springer, Date: 2002. New. 2002. Springer ISBN 3540594361 9783540594369 [IN]

SR-ECOMMERCE. New. SR-ECOMMERCE ISBN 3540594361 9783540594369 [IN]