Results

eNauka >  Results >  Quantified Constraint Satisfaction Problem on Semicomplete Digraphs
Title: Quantified Constraint Satisfaction Problem on Semicomplete Digraphs
Authors: Đapić, Petar  ; Marković, Petar  ; Martin, Barnaby
Issue Date: 2017
Publication: ACM Transactions on Computational Logic
ISSN: 1529-3785 ACM Transactions on Computational Logic Search Idenfier
Type: Article
Collation: vol. 18 br. 1 str. 1-47
DOI: 10.1145/3007899
WoS-ID: 000399803800002
Scopus-ID: 2-s2.0-85018478998
URI: https://enauka.gov.rs/handle/123456789/501027
https://www.cris.uns.ac.rs/record.jsf?recordId=106809&source=eNauka&language=en
Metadata source: Migracija
M-category: 
21aM21a

4
SCOPUSTM
3
OpenCitations
4
WEB OF SCIENCETM
Altmetric
Dimensions
Unpaywall

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