Optimal heuristic algorithms for the image of an injective function
From MaRDI portal
Publication:1946839
DOI10.1007/s10958-012-1102-yzbMath1261.68071OpenAlexW1969374263WikidataQ114225275 ScholiaQ114225275MaRDI QIDQ1946839
Edward A. Hirsch, V. O. Nikolaenko, Dmitry Itsykson, Alexander V. Smal
Publication date: 9 April 2013
Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10958-012-1102-y
Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Randomized algorithms (68W20)
Cites Work
- Speedup for natural problems and noncomputability
- On optimal heuristic randomized semidecision procedures, with applications to proof complexity and cryptography
- Propositional proof systems, the consistency of first order theories and the complexity of computations
- Average-Case Complexity
- Optimal Acceptors and Optimal Proof Systems
- Tiny families of functions with random properties: A quality-size trade-off for hashing
- Unnamed Item
- Unnamed Item
This page was built for publication: Optimal heuristic algorithms for the image of an injective function