Sciweavers

41 search results - page 9 / 9
» Ambiguity and structural properties of basic sequence diagra...
Sort
View
COCO
2009
Springer
117views Algorithms» more  COCO 2009»
13 years 12 months ago
The Proof Complexity of Polynomial Identities
Devising an efficient deterministic – or even a nondeterministic sub-exponential time – algorithm for testing polynomial identities is a fundamental problem in algebraic comp...
Pavel Hrubes, Iddo Tzameret