Spanning tree constrained determinantal point processes are hard to (approximately) evaluate (Q2060533)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Spanning tree constrained determinantal point processes are hard to (approximately) evaluate |
scientific article; zbMATH DE number 7443018
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Spanning tree constrained determinantal point processes are hard to (approximately) evaluate |
scientific article; zbMATH DE number 7443018 |
Statements
Spanning tree constrained determinantal point processes are hard to (approximately) evaluate (English)
0 references
13 December 2021
0 references
determinantal point process
0 references
spanning tree
0 references
normalizing constant
0 references
\#P-hardness
0 references
0 references
0 references
0 references
