Nina Sofia  Taslaman

Nina Sofia Taslaman

IT University of Copenhagen
Rued Langgaards Vej 7
DK-2300 Copenhagen S

Information Desk: 72185000

View graph of relations

Research outputs (3)

  1. Published

    Exponential Time Complexity of the Permanent and the Tutte Polynomial

    Research output: Journal Article or Conference Article in JournalJournal articleResearchpeer-review

  2. Published

    Exponential-Time Algorithms and Complexity of NP-Hard Graph Problems

    Research output: Book / Anthology / Report / Ph.D. thesisPh.D. thesis

  3. Published

    The exponential time complexity of computing the probability that a graph is connected

    Research output: Conference Article in Proceeding or Book/Report chapterArticle in proceedingsResearchpeer-review

ID: 1012044