In computer algebra, a triangular decomposition of a polynomial system S is a set of simpler polynomial systems S1, ..., Se such that a point is a solution of S if and only if it is a solution of one of the systems S1, ..., Se.
Attributes | Values |
---|---|
rdfs:label |
|
rdfs:comment |
|
sameAs | |
dbp:wikiPageUsesTemplate | |
Subject | |
gold:hypernym | |
prov:wasDerivedFrom | |
Wikipage page ID |
|
page length (characters) of wiki page |
|
Wikipage revision ID |
|
has abstract |
|
foaf:isPrimaryTopicOf | |
is Link from a Wikipage to another Wikipage of |