Nearly Sharp Complexity Bounds for Multiprocessor Algebraic Computations

Journal of Complexity - United States
doi 10.1006/jcom.1997.0436
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

Bounds for Nearly Best Approximations

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1975English

Linear Time Bounds for Median Computations

1972English

Computations With Algebraic Curves

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1989English

Nearly Tight Bounds for Testing Function Isomorphism

2011English

Sharp Bounds for Neuman Means With Applications

Journal of Nonlinear Science and Applications
Number TheoryAnalysisAlgebra
2016English

Sharp Entrywise Perturbation Bounds for Markov Chains

SIAM Journal on Matrix Analysis and Applications
Analysis
2015English

Sharp Bounds for Sums of Dependent Risks

Journal of Applied Probability
MathematicsStatisticsUncertaintyProbability
2013English

A Complexity-Based Hierarchy for Multiprocessor Synchronization

2016English

Sharp Weighted Bounds for Fractional Integral Operators

Journal of Functional Analysis
Analysis
2010English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy