Cover Image

Spanning tree constrained determinantal point processes are hard to (approximately) evaluate

Tatsuya Matsuoka, Naoto Ohsaka
Year of publication:
2021
Authors: Matsuoka, Tatsuya ; Ohsaka, Naoto
Published in:
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 49.2021, 3, p. 304-309
Subject: #P-hardness | Determinantal point process | Normalizing constant | Spanning tree
Online Resource
Check full text access |
Check Google Scholar
In libraries world-wide (WorldCat)
In German libraries (KVK)
subito order
I need help

Which error do you want to report?

Report: URL of this record is broken

Please note: Sometimes more than one URL is available for a resource. Please click on "More Options" to display these URLs

Report: Addition of an URL to that resource

Please note: Sometimes more than one URL is available for a resource. Please click on "More Options" to display these URLs

Report: The language(s) of that resource is/are…

Please note: Required language not in the list? Please use comment field

Report: Addition of an identifier to that resource

Report: report typo

Report: Add statement

Report: Add keywords

Please use the commentary box to describe other errors

Would you like to receive a feedback?

Please type the code from the image

For general questions please use this address.

Persistent link: https://www.econbiz.de/10012591613
Similar items by subject