Please use this identifier to cite or link to this item: https://open.uns.ac.rs/handle/123456789/18451
Title: Quantified Constraint Satisfaction Problem on Semicomplete Digraphs
Authors: Đapić, Petar 
Marković, Petar 
Martin Barnaby
Issue Date: 2017
Journal: ACM Transactions on Computational Logic
URI: https://open.uns.ac.rs/handle/123456789/18451
ISSN: 1529-3785
DOI: 10.1145/3007899
(BISIS)106809
Appears in Collections:PMF Publikacije/Publications

Show full item record

Page view(s)

8
Last Week
5
Last month
0
checked on May 10, 2024

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.