On the communication complexity of Lipschitzian optimization for the coordinated model of computation (Q1578430): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2117680112 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds on Information Transfer in Distributed Computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4001523 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Complexity Results for Matrix Computations on Parallel Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Communication Complexity of Solving a Polynomial Equation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3967358 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040887 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication complexity of the Gaussian elimination algorithm on multiprocessors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimax models in the theory of numerical methods. Transl. from the 1989 Russian orig. by Olga Chuyan / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993279 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication complexity of convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3326832 / rank
 
Normal rank

Latest revision as of 12:28, 30 May 2024

scientific article
Language Label Description Also known as
English
On the communication complexity of Lipschitzian optimization for the coordinated model of computation
scientific article

    Statements

    Identifiers