Mathematical Foundations of Computer Science 2005
From MaRDI portal
Publication:5492879
DOI10.1007/11549345zbMath1156.68402OpenAlexW2494705596MaRDI QIDQ5492879
Publication date: 20 October 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11549345
Analysis of algorithms and problem complexity (68Q25) Determinants, permanents, traces, other special matrix functions (15A15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Randomized algorithms (68W20)
Related Items (13)
Computing the permanent of (some) complex matrices ⋮ A stability result using the matrix norm to bound the permanent ⋮ Some Inapproximability Results of MAP Inference and Exponentiated Determinantal Point Processes ⋮ On the Complexity of Constrained Determinantal Point Processes ⋮ Log-concave polynomials. II: High-dimensional walks and an FPRAS for counting bases of a matroid ⋮ An efficient tree decomposition method for permanents and mixed discriminants ⋮ Approximating permanents and hafnians ⋮ Stability and complexity of mixed discriminants ⋮ Unnamed Item ⋮ Spanning tree constrained determinantal point processes are hard to (approximately) evaluate ⋮ On the classical complexity of sampling from quantum interference of indistinguishable bosons ⋮ A quantum hash function with grouped coarse-grained boson sampling ⋮ A Tight Analysis of Bethe Approximation for Permanent
This page was built for publication: Mathematical Foundations of Computer Science 2005
