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

VC Density of Set Systems Definable in Tree-Like Graphs

Uproszczony widok
dc.affiliationUniwersytet Warszawski
dc.conference.countryCzechy
dc.conference.datefinish2020-08-28
dc.conference.datestart2020-08-24
dc.conference.placePrague
dc.conference.seriesInternational Symposium on Mathematical Foundations of Computer Science
dc.conference.seriesInternational Symposium on Mathematical Foundations of Computer Science
dc.conference.seriesshortcutMFCS
dc.conference.shortcutMFCS 2020
dc.conference.weblinkhttp://mfcs.mff.cuni.cz/2020/
dc.contributor.authorPilipczuk, Michał
dc.contributor.authorPaszke, Adam
dc.date.accessioned2024-01-26T11:45:57Z
dc.date.available2024-01-26T11:45:57Z
dc.date.copyright2020-08-18
dc.date.issued2020
dc.description.accesstimeAT_PUBLICATION
dc.description.financePublikacja bezkosztowa
dc.description.versionFINAL_PUBLISHED
dc.description.volume170
dc.identifier.doi10.4230/LIPICS.MFCS.2020.78
dc.identifier.issn1868-8969
dc.identifier.urihttps://repozytorium.uw.edu.pl//handle/item/124575
dc.identifier.weblinkhttps://doi.org/10.4230/LIPIcs.MFCS.2020.78
dc.languageeng
dc.pbn.affiliationcomputer and information sciences
dc.relation.ispartofLeibniz International Proceedings in Informatics
dc.relation.pages78:1--78:13
dc.rightsCC-BY
dc.sciencecloudnosend
dc.titleVC Density of Set Systems Definable in Tree-Like Graphs
dc.typeJournalArticle
dspace.entity.typePublication