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

  1. 2014
  2. Published

    Exponential Time Complexity of the Permanent and the Tutte Polynomial

    Dell, H., Husfeldt, T., Marx, D., Taslaman, N. S. & Wahlén, M., 2014, In: A C M Transactions on Algorithms. 10, 4, p. 21:1-21:32 32 p., 21.

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

ID: 1012044