Resumen
We show that the dominance problem for CP-nets is P-hard, and that the dominance problem for the more general ase of cyclic CP-nets is PSPACE omplete.
| Idioma original | English |
|---|---|
| Publicación | Dagstuhl Seminar Proceedings |
| Volumen | 4421 |
| Estado | Published - 2005 |
| Evento | Algebraic Methods in Computational Complexity 2004 - Wadern, Germany Duración: oct 10 2004 → oct 15 2004 |
Nota bibliográfica
Publisher Copyright:© 2005 Dagstuhl Seminar Proceedings. All rights reserved.
Financiación
The author a knowledges the input from the logi and AI seminar at the University of Kentu ky and pro ofreading by Chris Lusena and Andy Klapp er. Thanks are due to Andy Klapp er for the observation ab out self lo ops and improving ips. This work partially supp orted by NSF grants CCR-0100040 and ITR-0325063. The main result and others app ear, with signi antly di erent pro ofs, in [6℄.
| Financiadores | Número del financiador |
|---|---|
| National Science Foundation (NSF) | CCR-0100040, ITR-0325063 |
ASJC Scopus subject areas
- Software
- Hardware and Architecture
- Control and Systems Engineering
Huella
Profundice en los temas de investigación de 'Preferences and Domination'. En conjunto forman una huella única.Citar esto
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver