auto
small
medium
large
x-large
auto
small
medium
large
x-large
Jump to page
Look up in index
Search
Search NKS | Online
1 - 1 of 1 for
GroebnerBasis
Note (a) for Undecidability and Intractability
And certainly pattern matching with __ in Mathematica, as well as polynomial manipulation functions like
GroebnerBasis
, routinely deal with problems that are formally NP-complete.
1