Change search
ReferencesLink to record
Permanent link

Direct link
NP-Completeness: Some graph theoretic examples
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Mathematics, Algebra and Geometry.
2016 (English)Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
Place, publisher, year, edition, pages
2016. , 22 p.
Series
U.U.D.M. project report, 2016:38
National Category
Algebra and Logic
Identifiers
URN: urn:nbn:se:uu:diva-302327OAI: oai:DiVA.org:uu-302327DiVA: diva2:957144
Educational program
Bachelor Programme in Mathematics
Supervisors
Examiners
Available from: 2016-09-01 Created: 2016-09-01 Last updated: 2016-09-01Bibliographically approved

Open Access in DiVA

fulltext(385 kB)10 downloads
File information
File name FULLTEXT01.pdfFile size 385 kBChecksum SHA-512
6750761dd913ec499a95268caa0f00ec64c97b1da5703d794f435987eb6e0f4f88e3e4af00068243bcfafd3a8b14f8e21022e36c4da55c907537a9a62844e01e
Type fulltextMimetype application/pdf

By organisation
Algebra and Geometry
Algebra and Logic

Search outside of DiVA

GoogleGoogle Scholar
Total: 10 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 23 hits
ReferencesLink to record
Permanent link

Direct link