The foundations of computational complexity theory go back to Alan Thring in the 1930s who was concerned with the existence of automatic procedures deciding the validity of mathematical statements. The first example of such a problem was the undecidability of the Halting Problem which is essentially the question of debugging a computer program: Will a given program eventu� ally halt? Computational complexity today addresses the quantitative aspects of the solutions obtained: Is the problem to be solved tractable? But how does one measure the intractability of computation? Several ideas were proposed: A. Cobham [Cob65] raised the question of what is the right model in order to measure a "computation step" , M. Rabin [Rab60] proposed the introduction of axioms that a complexity measure should satisfy, and C. Shannon [Sha49] suggested the boolean circuit that computes a boolean function. However, an important question remains: What is the nature of computa� tion? In 1957, John von Neumann [vN58] wrote in his notes for the Silliman Lectures concerning the nature of computation and the human brain that . . . logics and statistics should be primarily, although not exclusively, viewed as the basic tools of 'information theory'. Also, that body of experience which has grown up around the planning, evaluating, and coding of complicated logical and mathematical automata will be the focus of much of this information theory. The most typical, but not the only, such automata are, of course, the large electronic computing machines.

From the Back Cover

This textbook presents a survey of research on boolean functions, circuits, parallel computation models, function algebras, and proof systems. Its main aim is to elucidate the structure of "fast" parallel computation. The complexity of parallel computation is emphasized through a variety of techniques ranging from finite combinatorics, probability theory, and finite group theory to finite model theory and proof theory. Nonuniform 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.
The book will benefit advanced undergraduate and graduate students as well as researchers in the field of complexity theory.

"About this title" may belong to another edition of this title.

Store Description

Account dedicated to Print on Demand titles. Brook Bookstore offers a wide selection of books with a continuously updated catalog and fast shipments all over the world. We hold distribution rights with all of the publishers we promote and are in continuous search of new interesting titles to propose to our customers. We are part of Brandon Group SRL (an Italian company) and all of the orders are shipped from Europe. Depending on availability orders will be picked from our different warehouses. CONTACT US If you have any questions please do not hesitate to contact us sending a message to our store. We have a well prepared customer service team who will be happy to assist you. Our working hours are from Monday to Friday from 9:30 to 18:30 (CET, UTC +1) so messages received during the weekends might be responded with a slight delay but we guarantee you will get back to you as soon as possible. RETURNS If you want to return your order, please submit your request through Abebooks platform. Returns requests are managed case by case by our team and always in line with Abebooks policies: AbeBooks? Return Policy guarantees that you can return any book for a refund within 30 days, when the return is due to an error on the bookseller?s part. When the motive of the return is not due to an error of the seller it is up to Brook Bookstore to accept the return or else after studying the case. CANCELLATION You can send a cancellation request to our customer service team while the package has not yet been shipped. After that we cannot ensure we can retrieve the parcel but we suggest you to get in touch with us in order to verify the case. INVOICE You can request the invoice to be issued together with the shipment of the order or, at the latest, in the same month of the shipment.

Visit Seller's Storefront

Seller's business information

Brandon Group S.R.L.
Via Vannella Gaetani 27, Brandon Group, Napoli, NA, 80121, Italy

Sale & Shipping Terms

Terms of Sale

Account dedicated to Print on Demand titles.

CANCELLATION
You can send a cancellation request from the order page while the package has not yet been shipped. After that we cannot ensure we can retrieve the parcel but we suggest you to get in touch with us in order to verify the case.

INVOICE
You can request the invoice to be issued together with the shipment of the order or, at the latest, in the same month of the shipment.

RETURNS
If you want to return your order, please contact us for authoriz...

More Information

Shipping Terms

Shipping rates from Italy to U.S.A.

Shipping rates from Italy to U.S.A.
Order quantity	25 to 40 business days	60 to 60 business days
First item	US$ 9.30	US$ 593.90

Delivery times are set by sellers and vary by carrier and location. Orders passing through Customs may face delays and buyers are responsible for any associated duties or fees. Sellers may contact you regarding additional charges to cover any increased costs to ship your items.