Please use this identifier to cite or link to this item:
https://research.matf.bg.ac.rs/handle/123456789/1807
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Marić, Filip | en_US |
dc.contributor.author | Spasić, Mirko | en_US |
dc.contributor.author | Thiemann, René | en_US |
dc.date.accessioned | 2025-03-26T11:27:31Z | - |
dc.date.available | 2025-03-26T11:27:31Z | - |
dc.date.issued | 2018 | - |
dc.identifier.uri | https://research.matf.bg.ac.rs/handle/123456789/1807 | - |
dc.language.iso | en | en_US |
dc.relation.ispartof | Archive of Formal Proofs | en_US |
dc.title | An Incremental Simplex Algorithm with Unsatisfiable Core Generation | en_US |
dc.type | Article | en_US |
dc.identifier.url | https://www.isa-afp.org/entries/Simplex.html | - |
dc.identifier.url | https://www.isa-afp.org/browser_info/current/AFP/Simplex/document.pdf | - |
dc.contributor.affiliation | Informatics and Computer Science | en_US |
dc.contributor.affiliation | Informatics and Computer Science | en_US |
dc.relation.issn | 2150-914X | en_US |
item.grantfulltext | none | - |
item.cerifentitytype | Publications | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
item.openairetype | Article | - |
item.fulltext | No Fulltext | - |
item.languageiso639-1 | en | - |
crisitem.author.dept | Informatics and Computer Science | - |
crisitem.author.dept | Informatics and Computer Science | - |
crisitem.author.orcid | 0000-0001-7219-6960 | - |
crisitem.author.orcid | 0000-0002-9304-4007 | - |
Appears in Collections: | Research outputs |
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.