—A space bounded Stack Machine is a regular Turing Machine with a read-only input tape, several space bounded read-write work tapes, and an unbounded stack. Stack Machines with a...
Background: Multiple sequence alignment is fundamental. Exponential growth in computation time appears to be inevitable when an optimal alignment is required for many sequences. E...
In this paper, we study PAC-leaming algorithms for specialized classes of deterministic finite automata (DFA). Inpartictdar, we study branchingprogrsms, and we investigate the int...
Various efforts ([?, ?, ?]) have been made in recent years to derandomize probabilistic algorithms using the complexity theoretic assumption that there exists a problem in E = dti...
Russell Impagliazzo, Ronen Shaltiel, Avi Wigderson
We modify the multilevel successive elimination algorithm (MSEA) to make it compatible with the motion estimation required for the H.264/AVC video coding standard. The algorithm m...