Spanning tree constrained determinantal point processes are hard to (approximately) evaluate
type: Item
instance of: scholarly article
title: Spanning tree constrained determinantal point processes are hard to (approximately) evaluate
author: Tatsuya Matsuoka
author: Naoto Ohsaka
published in: Operations Research Letters
publication date: 2021-12-13T00:00:00Z
full work available at URL: https://arxiv.org/abs/2102.12646
Mathematics Subject Classification ID: 68-XX
Mathematics Subject Classification ID: 15-XX
zbMATH DE Number: 7443018
zbMATH Keywords: determinantal point process
zbMATH Keywords: spanning tree
zbMATH Keywords: normalizing constant
zbMATH Keywords: \#P-hardness
MaRDI profile type: Publication
OpenAlex ID: W3132144444
cites work: An algorithm for the Tutte polynomials of graphs of bounded treewidth
cites work: A Randomised Approximation Algorithm for Counting the Number of Forests in Dense Graphs
cites work: A partial k-arboretum of graphs with bounded treewidth
cites work: Eynard-Mehta theorem, Schur process, and their Pfaffian analogs
cites work: On the Complexity of Constrained Determinantal Point Processes
cites work: On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic
cites work: Parameterized Algorithms
cites work: Approximating the permanent of graphs with large factors
cites work: The relative complexity of approximate counting problems
cites work: Systems of distinct representatives and linear algebra
cites work: Q5684698
cites work: A general framework for graph sparsification
cites work: Mathematical Foundations of Computer Science 2005
cites work: A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries
cites work: Random generation of combinatorial structures from a uniform distribution
cites work: Determinantal point processes for machine learning
cites work: The coincidence approach to stochastic point processes
cites work: Evaluating the Tutte Polynomial for Graphs of Bounded Tree-Width
cites work: Graph minors. II. Algorithmic aspects of tree-width
cites work: Q3818127
cites work: The complexity of computing the permanent
cites work: The Computational Complexity of the Tutte Plane: the Bipartite Case
DOI: 10.1016/J.ORL.2021.02.004
description: scientific article; zbMATH DE number 7443018