On Fast Heuristic Non-deterministic Algorithms and Short Heuristic Proofs

DOI10.3233/FI-2014-1036zbMath1318.68086OpenAlexW2124759116MaRDI QIDQ2934878

Dmitry Itsykson, Dmitry Sokolov

Publication date: 22 December 2014

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/fi-2014-1036

zbMATH Keywords

proof systemsArthur-Merlin gamesnon-deterministic algorithmheuristic computation

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (1)

Circuit Lower Bounds for Average-Case MA

This page was built for publication: On Fast Heuristic Non-deterministic Algorithms and Short Heuristic Proofs