scientific article; zbMATH DE number 3637287
From MaRDI portal
Publication:4197343
zbMath0409.68030MaRDI QIDQ4197343
Publication date: 1979
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (25)
Physical quantum algorithms ⋮ A tight bound for approximating the square root ⋮ Smoothing the Gap Between NP and ER ⋮ Real data-integer solution problems within the Blum-Shub-Smale computational model ⋮ P-RAM vs. RP-RAM ⋮ Four Soviets walk the dog: improved bounds for computing the Fréchet distance ⋮ A computation model with automatic functions and relations as primitive operations ⋮ Addition machines, automatic functions and open problems of Floyd and Knuth ⋮ Financial networks with singleton liability priorities ⋮ Financial networks with singleton liability priorities ⋮ Improved bounds for finger search on a RAM ⋮ The Bell-Kochen-Specker theorem ⋮ Division in idealized unit cost RAMs ⋮ Bounds for Semi-disjoint Bilinear Forms in a Unit-Cost Computational Model ⋮ On Faster Integer Calculations Using Non-arithmetic Primitives ⋮ Arbitrary sequence RAMs ⋮ Semidefinite programming and arithmetic circuit evaluation ⋮ A weak version of the Blum, Shub, and Smale model ⋮ Equivalence problems for circuits over sets of natural numbers ⋮ On the minimum gap between sums of square roots of small integers ⋮ Dynamic interpolation search revisited ⋮ Fitting a \(C^m\)-smooth function to data. II ⋮ The \(C^m\) norm of a function with prescribed jets. II ⋮ On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines ⋮ Monomials in arithmetic circuits: complete problems in the counting hierarchy
This page was built for publication:
