Télécharger le livre :  Computational Complexity of Solving Equation Systems
Ajouter à ma liste d'envies
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...

Editeur : Springer
Parution : 2015-07-24

PDF, ePub

52,74