Artykuł w czasopiśmie
Brak miniatury
Licencja
ClosedAccessDostęp zamknięty
 

The Complexity of the Diagonal Problem for Recursion Schemes

Uproszczony widok
dc.affiliationUniwersytet Warszawski
dc.conference.countryIndie
dc.conference.datefinish2017-12-15
dc.conference.datestart2017-12-11
dc.conference.placeKanpur
dc.conference.seriesFoundations of Software Technology and Theoretical Computer Science
dc.conference.seriesFoundations of Software Technology and Theoretical Computer Science
dc.conference.seriesshortcutFST&TCS
dc.conference.shortcutFSTTCS 2017
dc.conference.weblinkhttps://www.fsttcs.org.in/archives/2017/
dc.contributor.authorParys, Paweł
dc.date.accessioned2024-01-26T10:09:22Z
dc.date.available2024-01-26T10:09:22Z
dc.date.issued2018
dc.description.financeNie dotyczy
dc.identifier.doi10.4230/LIPICS.FSTTCS.2017.45
dc.identifier.urihttps://repozytorium.uw.edu.pl//handle/item/122015
dc.languageeng
dc.pbn.affiliationcomputer and information sciences
dc.rightsClosedAccess
dc.sciencecloudnosend
dc.titleThe Complexity of the Diagonal Problem for Recursion Schemes
dc.typeJournalArticle
dspace.entity.typePublication