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...
| Main Author: | Broniek, Przemysław (Author) |
|---|---|
| Corporate Author: | SpringerLink (Online service) |
| Format: | Electronic eBook |
| Language: | English |
| Published: |
Cham :
Springer International Publishing : Imprint: Springer,
2015.
|
| Edition: | 1st ed. 2015. |
| Series: | SpringerBriefs in Philosophy,
|
| Subjects: | |
| Online Access: | Full Text via HEAL-Link |
Similar Items
-
Logical Foundations of Mathematics and Computational Complexity A Gentle Introduction /
by: Pudlák, Pavel
Published: (2013) -
Parameterized Complexity Theory
by: Flum, Jörg, et al.
Published: (2006) -
Logical Foundations of Computer Science International Symposium, LFCS 2009, Deerfield Beach, FL, USA, January 3-6, 2009. Proceedings /
Published: (2009) -
Lectures on Logic and Computation ESSLLI 2010 Copenhagen, Denmark, August 2010, ESSLLI 2011, Ljubljana, Slovenia, August 2011, Selected Lecture Notes /
Published: (2012) -
Pristine Perspectives on Logic, Language, and Computation ESSLLI 2012 and ESSLLI 2013 Student Sessions. Selected Papers /
Published: (2014)