The following pages link to (Q4847928):
Displayed 8 items.
- An improved lower bound for approximating minimum GCD multiplier in \(\ell _\infty \) norm (GCDM\(_\infty\)) (Q924126) (← links)
- Physically-relativized Church-Turing hypotheses: physical foundations of computing and complexity theory of computational physics (Q1036536) (← links)
- Effective subgroup separability of finitely generated nilpotent groups (Q1647350) (← links)
- Asymptotic determinacy of path queries using union-of-paths views (Q2402616) (← links)
- The Brun gcd algorithm in high dimensions is almost always subtractive (Q2409010) (← links)
- Parallel complexity for nilpotent groups (Q5084295) (← links)
- Logspace and compressed-word computations in nilpotent groups (Q5100019) (← links)
- (Q5101342) (← links)