A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Incremental Branching Programs
2007
Theory of Computing Systems
In this paper we propose the study of a new model of restricted branching programs which we call incremental branching programs. This is in line with the program proposed by Cook in [Co74] as an approach for separating the class of problems solvable in logarithmic space from problems solvable in polynomial time, focusing on the P-complete problem GEN. We show that our model captures and possibly supersedes previously studied structured models of computation for GEN, namely marking machines
doi:10.1007/s00224-007-9049-y
fatcat:iz3ywtc64rbrjbfnmlr5qu7efu