A space optimal algorithm to solve a problem - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports Year : 2000

A space optimal algorithm to solve a problem


Given a semi-decidable relation $R$, and a string $x$, deciding wether or not there is a witness $y$ such that $(x,y) \in R$ is a very hard problem. However, Leonid Levin has constructed a time optimal algorithm to solve the above question. The algorithms is not based on a brute-force search but on testing programs that generate witness. Following Levin's work, we define a space-efficient algorithm that solves the above question. Then, we discuss on the ability to improve Savitch's Theorem


Other [cs.OH]
Not file

Dates and versions

inria-00099303 , version 1 (26-09-2006)


  • HAL Id : inria-00099303 , version 1


Jérôme Besombes. A space optimal algorithm to solve a problem. [Intern report] A00-R-135 || besombes00a, 2000, 5 p. ⟨inria-00099303⟩
175 View
0 Download


Gmail Facebook Twitter LinkedIn More