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...
Saved in:
| Main Author: | |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Cham :
Springer International Publishing : Imprint: Springer,
2015.
|
| Edition: | 1st ed. 2015. |
| Series: | SpringerBriefs in Philosophy,
|
| Subjects: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
3rd Floor Main Library
| Call Number: |
A1234.567 |
|---|---|
| Copy 1 | Available |