ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2102.12646
  4. Cited By
Spanning Tree Constrained Determinantal Point Processes are Hard to
  (Approximately) Evaluate

Spanning Tree Constrained Determinantal Point Processes are Hard to (Approximately) Evaluate

25 February 2021
Tatsuya Matsuoka
Naoto Ohsaka
ArXiv (abs)PDFHTML

Papers citing "Spanning Tree Constrained Determinantal Point Processes are Hard to (Approximately) Evaluate"

1 / 1 papers shown
Title
Computational Complexity of Normalizing Constants for the Product of
  Determinantal Point Processes
Computational Complexity of Normalizing Constants for the Product of Determinantal Point Processes
Naoto Ohsaka
Tatsuya Matsuoka
53
0
0
28 Nov 2021
1