FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
From MaRDI portal
Publication:5465859
DOI10.1007/b104325zbMath1117.68547OpenAlexW2950473912MaRDI QIDQ5465859
Shiva Prasad Kasiviswanathan, Martin Fuerer
Publication date: 12 August 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b104325
Determinants, permanents, traces, other special matrix functions (15A15) Random matrices (algebraic aspects) (15B52) Approximation algorithms (68W25) Randomized algorithms (68W20) Matrices of integers (15B36)
Related Items (3)
Completeness, approximability and exponential time results for counting problems with easy decision version ⋮ Solution counting algorithms for constraint-centered search heuristics ⋮ Scaling matrices and counting the perfect matchings in graphs
This page was built for publication: FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science