Cargando…

Computational Complexity of Solving Equation Systems

This volume considers the computational complexity of determining whether a system of equations over a fixed algebra A has a solution. It examines in detail the two problems this leads to: SysTermSat(A) and SysPolSat(A), in which equations are built out of terms or polynomials, respectively. The boo...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor principal: Broniek, Przemysław (Autor)
Autor Corporativo: SpringerLink (Online service)
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Cham : Springer International Publishing : Imprint: Springer, 2015.
Edición:1st ed. 2015.
Colección:SpringerBriefs in Philosophy,
Temas:
Acceso en línea:Texto Completo