Author image not provided
 Petar Dapić

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article0.00
Citation Count0
Publication count1
Publication years2017-2017
Available for download1
Average downloads per article45.00
Downloads (cumulative)45
Downloads (12 Months)13
Downloads (6 Weeks)2
SEARCH
ROLE


AUTHOR'S COLLEAGUES
See all colleagues of this author




BOOKMARK & SHARE


1 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 1 of 1
Sort by:

1 published by ACM
April 2017 ACM Transactions on Computational Logic (TOCL): Volume 18 Issue 1, April 2017
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 2,   Downloads (12 Months): 13,   Downloads (Overall): 45

Full text available: PDFPDF
We study the (non-uniform) quantified constraint satisfaction problem QCSP( H ) as H ranges over semicomplete digraphs. We obtain a complexity-theoretic trichotomy: QCSP( H ) is either in P, is NP-complete, or is Pspace-complete. The largest part of our work is the algebraic classification of precisely which semicomplete digraphs enjoy ...
Keywords: Quantified constraints, complexity, polymorphism, semicomplete digraphs



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us