𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Algorithms and complexity results for persuasive argumentation

✍ Scribed by Eun Jung Kim; Sebastian Ordyniak; Stefan Szeider

Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
299 KB
Volume
175
Category
Article
ISSN
0004-3702

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Point algebras for temporal reasoning: A
Point algebras for temporal reasoning: Algorithms and complexity
✍ Mathias Broxvall; Peter Jonsson πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 447 KB

We investigate the computational complexity of temporal reasoning in different time models such as totally-ordered, partially-ordered and branching time. Our main result concerns the satisfiability problem for point algebras and point algebras extended with disjunctions-for these problems, we identi

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