scientific article; zbMATH DE number 3214539
From MaRDI portal
Publication:5341755
zbMath0132.24803MaRDI QIDQ5341755
Publication date: 1962
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (17)
Probabilistic parallel prefix computation ⋮ The delay of circuits whose inputs have specified arrival times ⋮ Communication-efficient parallel algorithms for distributed random-access machines ⋮ Efficient parallel circuits and algorithms for division ⋮ Parallel complexity of algebraic operations ⋮ Complexity theory of parallel time and hardware ⋮ Optimal and nearly optimal algorithms for approximating polynomial zeros ⋮ Tree-size bounded alternation ⋮ Complexity of approximation problems ⋮ ON THE MEANING OF WORKS BY V. M. KHRAPCHENKO ⋮ Limited width parallel prefix circuits ⋮ An improved parallel algorithm for integer GCD ⋮ Minimizing roundoff errors of prefix sums via dynamic construction of Huffman trees ⋮ Characteristic measures of switching functions ⋮ Monte Carlo circuits for the abelian permutation group intersection problem ⋮ Verifiable Stream Computation and Arthur--Merlin Communication ⋮ Monotone circuits for monotone weighted threshold functions
This page was built for publication:
