Parallel complexity of algebraic operations (Q4005330): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Simulation of Parallel Random Access Machines by Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3311653 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant Depth Reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5341755 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unbounded fan-in circuits and associative functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parity, circuits, and the polynomial-time hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4745979 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Prefix Computation / rank
 
Normal rank

Latest revision as of 11:52, 16 May 2024

scientific article
Language Label Description Also known as
English
Parallel complexity of algebraic operations
scientific article

    Statements

    Parallel complexity of algebraic operations (English)
    0 references
    0 references
    0 references
    26 September 1992
    0 references
    Arithmetic operations
    0 references
    algebraic operations
    0 references
    groups
    0 references
    semigroups
    0 references
    complexity
    0 references
    parallel realization by Boolean circuits
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references