Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Znaleziono wyników: 1

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: tree-width

Sortuj według:

Ogranicz wyniki do:

Tree-width in Algebraic Complexity

Meer K.

Fundamenta Informaticae

2010

Vol. 98, nr 4

391-409

The paper surveys some of the author's work studying the algorithmic importance of the tree-width notion in algebraic frameworks. Two approaches are described. The first gives an algorithmicmeta-theoremfor certain logically characterized propertieswithin the Blum-Shub-Smale BSS model of computation over the reals. The second reports on recent joint work with P. Koiran relating Boolean complexity and Valiant’s approach to study families of polynomial systems over infinite fields and their complexity. We define particular families of polynomials via bounding the tree-width of suitably attached graphs and study the expressive power of the resulting families. The work described here is partially co-authoredwith and partially verymuch influenced by previous work of Janos A. Makowsky.