On matijasevitch's nontraditional approach to search problems

DOI10.1016/0020-0190(89)90067-7zbMath0685.68041OpenAlexW2028097603MaRDI QIDQ1262126

Yuri Gurevich, Andreas Blass

Publication date: 1989

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2027.42/27850

zbMATH Keywords

randomizationdifferential equationsNP-complete problemssatisfiability problemsearch problemsnontraditional approach

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10)

Cites Work

• Polynomial-average-time satisfiability problems
• Unnamed Item
• Unnamed Item