The browser you are using is not supported by this website. All versions of Internet Explorer are no longer supported, either by us or Microsoft (read more here: https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Please use a modern browser to fully experience our website, such as the newest versions of Edge, Chrome, Firefox or Safari etc.

Exponential time complexity of the permanent and the Tutte polynomial

På svenska

Author

  • Holger Dell
  • Thore Husfeldt
  • Martin Wahlén

Publishing year

2010

Language

English

Pages

426-437

Publication/Series

Lecture Notes in Computer Science

Volume

6198

Document type

Conference paper

Publisher

Springer

Topic

  • Computer Science

Conference name

37th International Colloquium on Automata, Languages and Programming (ICALP 2010)

Conference date

2010-07-06 - 2010-07-10

Conference place

Bordeaux, France

Status

Published

Project

  • Exact algorithms

Research group

  • Algorithms

ISBN/ISSN/Other

  • ISSN: 0302-9743
  • ISSN: 1611-3349