The monadic second-order logic of graphs. I. recognizable sets of finite graphs
Information and Computation
Easy problems for tree-decomposable graphs
Journal of Algorithms
Separating the eraser Turing machine classes Le, NLe, co-NLe and Pe
Theoretical Computer Science
Monadic second-order evaluations on tree-decomposable graphs
Theoretical Computer Science - Special issue on selected papers of the International Workshop on Computing by Graph Transformation, Bordeaux, France, March 21–23, 1991
On the complexity of quadratic programming in real number models of computation
Selected papers of the workshop on Continuous algorithms and complexity
Descriptive complexity theory over the real numbers
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Complexity and real computation
Complexity and real computation
Information and Computation - Special issue: logic and computational complexity
Discrete Applied Mathematics - Special issue on international workshop of graph-theoretic concepts in computer science WG'98 conference selected papers
The Effect of Null-Chains on the Complexity of Contact Schemes
FCT '89 Proceedings of the International Conference on Fundamentals of Computation Theory
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Counting truth assignments of formulas of bounded tree-width or clique-width
Discrete Applied Mathematics
Algorithms for propositional model counting
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
On the expressive power of planar perfect matching and permanents of bounded treewidth matrices
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
From a zoo to a zoology: descriptive complexity for graph polynomials
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Treewidth in verification: local vs. global
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Parameterized Complexity
| Hi-index | 0.00 |
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.