Nearly sharp complexity bounds for multiprocessor algebraic computations (Q1361876): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1006/jcom.1997.0436 / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W1969540178 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4079605 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Power of Real Turing Machines over Binary Inputs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4725742 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of deciding Tarski algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252710 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228517 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Point location in arrangements of hyperplanes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulating probabilistic by deterministic algebraic computation trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Betti Numbers of Real Varieties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for arithmetic networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for arithmetic networks. II: Sum of Betti numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for parallel linear programming and other problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for algebraic decision trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decision tree complexity and Betti numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Polyhedral Decision Problem / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1006/JCOM.1997.0436 / rank
 
Normal rank

Latest revision as of 18:45, 10 December 2024

scientific article
Language Label Description Also known as
English
Nearly sharp complexity bounds for multiprocessor algebraic computations
scientific article

    Statements

    Identifiers