𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Complexity results for structure-based causality

✍ Scribed by Thomas Eiter; Thomas Lukasiewicz

Book ID
108306927
Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
361 KB
Volume
142
Category
Article
ISSN
0004-3702

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Complexity results for triangular sets
Complexity results for triangular sets
✍ Γ‰ric Schost πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 510 KB

We study the representation of the solutions of a polynomial system by triangular sets, and concentrate on the positive-dimensional case. We reduce to dimension zero by placing the free variables in the base field, so the solutions can be represented by triangular sets with coefficients in a rationa

Complexity results for well-covered grap
Complexity results for well-covered graphs
✍ Ramesh S. Sankaranarayana; Lorna K. Stewart πŸ“‚ Article πŸ“… 1992 πŸ› John Wiley and Sons 🌐 English βš– 740 KB

## Abstract A graph with __n__ vertices is well covered if every maximal independent set is a maximum independent set and very well covered if every maximal independent set has size __n__/2. In this work, we study these graphs from an algorithmic complexity point of view. We show that well‐covered

Some Complexity Results for Polynomial I
Some Complexity Results for Polynomial Ideals
✍ Ernst W. Mayr πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 184 KB

In this paper, we survey some of our new results on the complexity of a number of problems related to polynomial ideals. We consider multivariate polynomials over some ring, like the integers or the rationals. For instance, a polynomial ideal membership problem is a (w + 1)-tuple P = ( f, g 1 , g 2