On the complexity of some computational problems in the Turing model Claus Diem November 18, 2013 Abstract Algorithms for concrete problems are usually described and analyzed in some random access machine model. This is

First Page		Document Content
Date: 2013-11-18 06:32:25		On the complexity of some computational problems in the Turing model Claus Diem November 18, 2013 Abstract Algorithms for concrete problems are usually described and analyzed in some random access machine model. This is Add to Reading List Source URL: www.mathematik.uni-leipzig.de Download Document from Source Website File Size: 317,23 KB Share Document on Facebook