Universal quantifiers and time complexity of random access machines
E Grandjean - Mathematical systems theory, 1985 - Springer
Let Sp (d∀) denote the class of spectra of prenex first-order sentences (with equality) with d
universal quantifiers. Let NRAM (T (n)) denote the class of sets (of positive integers) …
universal quantifiers. Let NRAM (T (n)) denote the class of sets (of positive integers) …
Array processing machines
J van Leeuwen, J Wiedermann - International Conference on …, 1985 - Springer
We present a new model of parallel computation called the" array processing machine" or
APM. The APM was designed to closely model the architecture of existing vector-and array …
APM. The APM was designed to closely model the architecture of existing vector-and array …
Notes on the complexity of sorting in abstract machines
M Penttonen, J Katajainen - BIT Numerical Mathematics, 1985 - Springer
The complexity of sorting with pointer machines and successor-predecessor random access
machines is studied. The size of the problem is defined as the length of the problem string. A …
machines is studied. The size of the problem is defined as the length of the problem string. A …
[引用][C] Fast simulation of Turing machines by random access machines
J Katajainen, J van Leeuwen - 1985 - Unknown Publisher
VLSI 向きハードウェアアルゴリズム: 2. ハードウェアアルゴリズムの基礎理論: 2.1 並列計算モデルと計算の複雑さ
笠井琢美 - 情報処理, 1985 - ipsj.ixsq.nii.ac.jp
一つーつの命令を順次実行していくという, 逐次型 な計算量の下界が示されてきてはいるが,(1)
を示す計算に関しては, 計算モデルも安定したものがあり, これまでに多くの効率のよいアルゴリズム …
を示す計算に関しては, 計算モデルも安定したものがあり, これまでに多くの効率のよいアルゴリズム …