Artykuł w czasopiśmie
Brak miniatury
Licencja
CC-BYCC-BY - Uznanie autorstwa
 

Tight complexity lower bounds for integer linear programming with few constraints

Uproszczony widok
dc.affiliationUniwersytet Warszawski
dc.conference.countryNiemcy
dc.conference.datefinish2019-03-16
dc.conference.datestart2019-03-13
dc.conference.placeBerlin
dc.conference.seriesInternational Symposium on Theoretical Aspects of Computer Science
dc.conference.seriesInternational Symposium on Theoretical Aspects of Computer Science
dc.conference.seriesshortcutSTACS
dc.conference.shortcutSTACS 2019
dc.conference.weblinkhttps://stacs2019.akt.tu-berlin.de/
dc.contributor.authorKnop, Dušan
dc.contributor.authorPilipczuk, Michał
dc.contributor.authorWrochna, Marcin
dc.date.accessioned2024-01-26T10:53:16Z
dc.date.available2024-01-26T10:53:16Z
dc.date.copyright2019-03-12
dc.date.issued2019
dc.description.accesstimeAT_PUBLICATION
dc.description.financeNie dotyczy
dc.description.versionFINAL_PUBLISHED
dc.description.volume126
dc.identifier.doi10.4230/LIPICS.STACS.2019.44
dc.identifier.issn1868-8969
dc.identifier.urihttps://repozytorium.uw.edu.pl//handle/item/123409
dc.identifier.weblinkhttp://www.scopus.com/inward/record.url?eid=2-s2.0-85069041785&partnerID=MN8TOARS
dc.languageeng
dc.pbn.affiliationcomputer and information sciences
dc.relation.ispartofLeibniz International Proceedings in Informatics
dc.relation.pages44:1--44:15
dc.rightsCC-BY
dc.sciencecloudnosend
dc.titleTight complexity lower bounds for integer linear programming with few constraints
dc.typeJournalArticle
dspace.entity.typePublication