Computing sparse permanents faster (Q1044712)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Computing sparse permanents faster	scientific article

Statements

scholarly article

0 references

Computing sparse permanents faster (English)

0 references

zbMATH Open document ID

0 references

10.1016/j.ipl.2005.06.007

0 references

Rocco A. Servedio

0 references

0 references

Information Processing Letters

0 references

publication date

18 December 2009

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

zbMATH Keywords

algorithms

0 references

combinatorial problems

0 references

computational complexity

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.ipl.2005.06.007

0 references

0 references

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

0 references

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

0 references

0 references

The complexity of computing the permanent

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1044712

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