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...
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 |
Ejemplares similares
-
Logical Foundations of Mathematics and Computational Complexity A Gentle Introduction /
por: Pudlák, Pavel
Publicado: (2013) -
Parameterized Complexity Theory
por: Flum, J., et al.
Publicado: (2006) -
Mathematics, Computer Science and Logic - A Never Ending Story The Bruno Buchberger Festschrift /
Publicado: (2013) -
Logical Foundations of Computer Science International Symposium, LFCS 2009, Deerfield Beach, FL, USA, January 3-6, 2009, Proceedings /
Publicado: (2009) -
The Nature of Computation: Logic, Algorithms, Applications 9th Conference on Computability in Europe, CiE 2013, Milan, Italy, July 1-5, 2013, Proceedings /
Publicado: (2013)