Block interpolation: a framework for tight exponential-time counting complexity (Q1640999)
From MaRDI portal
(Redirected from Item:Q3448800)
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Block interpolation: a framework for tight exponential-time counting complexity |
scientific article; zbMATH DE number 6498658
- Block Interpolation: A Framework for Tight Exponential-Time Counting Complexity
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Block interpolation: a framework for tight exponential-time counting complexity |
scientific article; zbMATH DE number 6498658 |
|
Statements
Block interpolation: a framework for tight exponential-time counting complexity (English)
0 references
Block Interpolation: A Framework for Tight Exponential-Time Counting Complexity (English)
0 references
14 June 2018
0 references
27 October 2015
0 references
exponential-time hypothesis
0 references
counting complexity
0 references
permanent
0 references
matching polynomial
0 references
independent set polynomial
0 references
Tutte polynomial
0 references
0 references
0.9942892789840698
0 references
0.8199805021286011
0 references
0.8064232468605042
0 references