Please use this identifier to cite or link to this item:
https://open.uns.ac.rs/handle/123456789/18451
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Đapić, Petar | en_US |
dc.contributor.author | Marković, Petar | en_US |
dc.contributor.author | Martin Barnaby | en_US |
dc.date.accessioned | 2020-12-13T12:44:48Z | - |
dc.date.available | 2020-12-13T12:44:48Z | - |
dc.date.issued | 2017 | - |
dc.identifier.issn | 1529-3785 | en_US |
dc.identifier.uri | https://open.uns.ac.rs/handle/123456789/18451 | - |
dc.language.iso | en | en_US |
dc.relation.ispartof | ACM Transactions on Computational Logic | en |
dc.source | CRIS UNS | - |
dc.source.uri | http://cris.uns.ac.rs | - |
dc.title | Quantified Constraint Satisfaction Problem on Semicomplete Digraphs | en_US |
dc.type | Journal/Magazine Article | en_US |
dc.identifier.doi | 10.1145/3007899 | - |
dc.identifier.doi | (BISIS)106809 | - |
dc.identifier.url | https://www.cris.uns.ac.rs/record.jsf?recordId=106809&source=BEOPEN&language=en | - |
dc.description.version | Unknown | en_US |
dc.relation.issue | 1 | - |
dc.relation.volume | 18 | - |
dc.identifier.externalcrisreference | (BISIS)106809 | - |
item.fulltext | No Fulltext | - |
item.grantfulltext | none | - |
crisitem.author.dept | Prirodno-matematički fakultet, Departman za matematiku i informatiku | - |
crisitem.author.dept | Prirodno-matematički fakultet, Departman za matematiku i informatiku | - |
crisitem.author.parentorg | Prirodno-matematički fakultet | - |
crisitem.author.parentorg | Prirodno-matematički fakultet | - |
Appears in Collections: | PMF Publikacije/Publications |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.