Please use this identifier to cite or link to this item:
https://open.uns.ac.rs/handle/123456789/30469
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Đapić Petar | - |
dc.contributor.author | Marković Petar | - |
dc.contributor.author | Martin Barnaby | - |
dc.date.accessioned | 2020-12-14T18:26:39Z | - |
dc.date.available | 2020-12-14T18:26:39Z | - |
dc.date.issued | 2014 | - |
dc.identifier.isbn | 978-3-662-43947-0 | - |
dc.identifier.uri | https://open.uns.ac.rs/handle/123456789/30469 | - |
dc.language.iso | en | - |
dc.relation.ispartof | Automata, Languages,and Programming, 41st International Colloquium on Automata, Languages and Programming, Copenhagen, Denmark, 2014, 8.-11. 7. 2014., No 41 | en |
dc.source | CRIS UNS | - |
dc.source.uri | http://cris.uns.ac.rs | - |
dc.title | QCSP on Semicomplete Digraphs | en |
dc.type | Conference Paper | en |
dc.identifier.doi | 10.1007/978-3-662-43948-7_70 | - |
dc.identifier.url | https://www.cris.uns.ac.rs/record.jsf?recordId=92861&source=BEOPEN&language=en | en |
dc.relation.lastpage | 858 | - |
dc.relation.firstpage | 847 | - |
dc.identifier.externalcrisreference | (BISIS)92861 | - |
item.grantfulltext | none | - |
item.fulltext | No Fulltext | - |
crisitem.author.dept | Departman za matematiku i informatiku | - |
crisitem.author.dept | 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.