Show simple item record

Determining the solvability of colorless tasks using combinatorial topology

dc.rights.licenseCC-BY-NC-ND
dc.contributor.advisorMeier, F.L.M.
dc.contributor.authorMeijer, M.
dc.date.accessioned2021-09-06T18:00:16Z
dc.date.available2021-09-06T18:00:16Z
dc.date.issued2019
dc.identifier.urihttps://studenttheses.uu.nl/handle/20.500.12932/787
dc.description.sponsorshipUtrecht University
dc.format.extent465970
dc.format.mimetypeapplication/pdf
dc.language.isoen
dc.titleDetermining the solvability of colorless tasks using combinatorial topology
dc.type.contentBachelor Thesis
dc.rights.accessrightsOpen Access
dc.subject.keywordsTopology, simplicial complex, protocol, distributed computing
dc.subject.courseuuWiskunde


Files in this item

Thumbnail
Name:
bachelor-thesis-max-meijer.pdf
Size:
455.0Kb
Format:
PDF
View/Open

This item appears in the following Collection(s)

Show simple item record