No label defined (Q5743447)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 7053325

Language	Label	Description	Also known as
English	No label defined	scientific article; zbMATH DE number 7053325

Statements

scholarly article

0 references

Andreas Björklund

0 references

publication date

10 May 2019

0 references

full work available at URL

https://arxiv.org/abs/1107.4466

0 references

https://dl.acm.org/citation.cfm?id=2095189

0 references

MaRDI profile type

MaRDI publication profile

0 references

Counting Subgraphs via Homomorphisms

0 references

A permanent algorithm with \(\text{exp}[\Omega(n^{1/3}/2\text{ln}n)]\) expected speedup for \(0-1\) matrices

0 references

Exact algorithms for exact satisfiability and number of perfect matchings

0 references

Set Partitioning via Inclusion-Exclusion

0 references

Fourier meets M\"{o}bius: fast subset convolution

0 references

Exponential Time Complexity of the Permanent and the Tutte Polynomial

0 references

Which problems have strongly exponential complexity?

0 references

A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries

0 references

Dynamic programming meets the principle of inclusion and exclusion

0 references

Partitioning into Sets of Bounded Cardinality

0 references

Saving space by algebraization

0 references

Fast Polynomial-Space Algorithms Using Möbius Inversion: Improving on Steiner Tree and Related Problems

0 references

0 references

0 references

Computing sparse permanents faster

0 references

The complexity of computing the permanent

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5743447

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5743447&oldid=36492102"