Introduction to computational complexity.

MaRDI QIDQ4955547zbMATH OpenFDO

Authors A. Bernasconi, Bruno Codenotti

Publication date 28 May 2000

zbMATH Keywords

Boolean circuitscomputational complexity

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Analysis of algorithms and problem complexity (68Q25)

Review text

The book represents a short introduction to some chapters in computational complexity. It includes computability theory, classical computational complexity, Boolean circuits, and a selection of advanced topics.

Recommendations

• scientific article; zbMATH DE number 5595162
• Computational Complexity
• scientific article; zbMATH DE number 4009816
• An overview of computational complexity
• Computational Complexity
• Computability and complexity theory.
• scientific article; zbMATH DE number 2027966
• scientific article; zbMATH DE number 1864855
• scientific article; zbMATH DE number 4106275
• scientific article; zbMATH DE number 4004169

Cited in

(1)

• Computational Complexity

This page was built for publication: Introduction to computational complexity.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4955547)