| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 8898381 | Differential Geometry and its Applications | 2017 | 18 Pages |
Abstract
In this note we suggest a new measure of the complexity of polynomials, the Ulrich complexity. Valiant's conjecture on the exponential complexity of the permanent would imply exponential behavior of the Ulrich complexity as well, and this may be easier to prove. We compute some families of examples, one of which has provably exponential behavior.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Analysis
Authors
Markus Bläser, David Eisenbud, Frank-Olaf Schreyer,