"The (Un)Scalability of Heuristic Approximators for NP-Hard Search Problems."

Sumedh Pendurkar et al. (2022)

> Home

Details and statistics

DOI: 10.48550/ARXIV.2209.03393

access: open

type: Informal or Other Publication

metadata version: 2022-09-26

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2209-03393
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2209-03393
Sumedh Pendurkar, Taoan Huang, Sven Koenig, Guni Sharon:
The (Un)Scalability of Heuristic Approximators for NP-Hard Search Problems. CoRR abs/2209.03393 (2022)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.