Artículo: AMZ-B0C4M9H236

Computational Complexity Theory Fundamentals - HandBook

Format:

Paperback

Kindle

Paperback

Detalles del producto
Disponibilidad
En stock
Peso con empaque
0.22 kg
Devolución
Condición
Nuevo
Producto de
Amazon
Viaja desde
USA

Sobre este producto
  • This book is an introduction to theoretical computer science, covering topics such as formal languages, automata theory, computability theory, and complexity theory. It provides a comprehensive overview of the foundational concepts, including regular languages and finite automata, context-free languages and pushdown automata, Turing machines and computability, and time and space complexity classes. The book also covers important theorems and results, such as the Pumping Lemma, the Church-Turing thesis, Godel's Incompleteness Theorem, and NP-completeness. It is written in a clear and concise manner, making it accessible to students and researchers with a basic understanding of discrete mathematics and programming. This book serves as an essential guide for anyone interested in the fundamental concepts of theoretical computer science.
$46,34
31% OFF
$31,96

IMPORT EASILY

By purchasing this product you can deduct VAT with your RUT number

$46,34
31% OFF
$31,96

3 meses de gracia en diferidos y hasta 6 meses sin intereses con Pacificard

Envío gratis
Llega en 5 a 12 días hábiles
Con envío
Tienes garantia de entrega
Este producto viaja de USA a tus manos en