Polynomial-time computable approximation of families of semialgebraic sets and combinatorial complexity (Q4005386)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial-time computable approximation of families of semialgebraic sets and combinatorial complexity |
scientific article |
Statements
Polynomial-time computable approximation of families of semialgebraic sets and combinatorial complexity (English)
0 references
26 September 1992
0 references
semialgebraic set
0 references
polynomial-time algorithm
0 references
\(P=NP\) problem
0 references
equinomial families
0 references
membership problem
0 references
