scientific article; zbMATH DE number 799777
From MaRDI portal
Publication:4847928
zbMath0834.68050MaRDI QIDQ4847928
Bohdan S. Majewski, George Havas
Publication date: 24 September 1995
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Number-theoretic algorithms; complexity (11Y16)
Related Items (8)
Effective subgroup separability of finitely generated nilpotent groups ⋮ Asymptotic determinacy of path queries using union-of-paths views ⋮ Parallel complexity for nilpotent groups ⋮ The Brun gcd algorithm in high dimensions is almost always subtractive ⋮ Logspace and compressed-word computations in nilpotent groups ⋮ An improved lower bound for approximating minimum GCD multiplier in \(\ell _\infty \) norm (GCDM\(_\infty\)) ⋮ Unnamed Item ⋮ Physically-relativized Church-Turing hypotheses: physical foundations of computing and complexity theory of computational physics
This page was built for publication:
