Please use this identifier to cite or link to this item: https://open.uns.ac.rs/handle/123456789/18451
DC FieldValueLanguage
dc.contributor.authorĐapić, Petaren_US
dc.contributor.authorMarković, Petaren_US
dc.contributor.authorMartin Barnabyen_US
dc.date.accessioned2020-12-13T12:44:48Z-
dc.date.available2020-12-13T12:44:48Z-
dc.date.issued2017-
dc.identifier.issn1529-3785en_US
dc.identifier.urihttps://open.uns.ac.rs/handle/123456789/18451-
dc.language.isoenen_US
dc.relation.ispartofACM Transactions on Computational Logicen
dc.sourceCRIS UNS-
dc.source.urihttp://cris.uns.ac.rs-
dc.titleQuantified Constraint Satisfaction Problem on Semicomplete Digraphsen_US
dc.typeJournal/Magazine Articleen_US
dc.identifier.doi10.1145/3007899-
dc.identifier.doi(BISIS)106809-
dc.identifier.urlhttps://www.cris.uns.ac.rs/record.jsf?recordId=106809&source=BEOPEN&language=en-
dc.description.versionUnknownen_US
dc.relation.issue1-
dc.relation.volume18-
dc.identifier.externalcrisreference(BISIS)106809-
item.fulltextNo Fulltext-
item.grantfulltextnone-
crisitem.author.deptPrirodno-matematički fakultet, Departman za matematiku i informatiku-
crisitem.author.deptPrirodno-matematički fakultet, Departman za matematiku i informatiku-
crisitem.author.parentorgPrirodno-matematički fakultet-
crisitem.author.parentorgPrirodno-matematički fakultet-
Appears in Collections:PMF Publikacije/Publications
Show simple 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.