conference-paper
Open access
Climbing algorithms (invited talk)
Research footprint
At a glance
- Citations
- 0
- References
- 1
- Comments
- 0
Paper overview
Abstract
NP (search) problems allow easy correctness tests for solutions. Climbing algorithms allow also easy assessment of how close to yielding the correct answer is the configuration at any stage of their run. This offers a great flexibility, as how sensible is any deviation from the standard procedures can be instantly assessed.
Record transparency
Publication details
- DOI
- 10.1145/3406325.3457137
- OpenAlex
- W3158611961
- Document type
- conference-paper
- Language
- EN
- Last metadata update
Comments
Log in to join the discussion.