Nina Sofia Taslaman
IT University of Copenhagen
Rued Langgaards Vej 7
DK-2300 Copenhagen S
Denmark
Information Desk: 72185000
Research outputs (3)
- Published
Exponential Time Complexity of the Permanent and the Tutte Polynomial
Research output: Journal Article or Conference Article in Journal › Journal article › Research › peer-review
- Published
Exponential-Time Algorithms and Complexity of NP-Hard Graph Problems
Research output: Book / Anthology / Report / Ph.D. thesis › Ph.D. thesis › Research
- Published
The exponential time complexity of computing the probability that a graph is connected
Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review
ID: 1012044