Efficient simulation of circuits by EREW PRAMs (Q911771): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient parallel algorithms for linear recurrence computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Representatives of Subsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounding Fan-out in Logical Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulation of Parallel Random Access Machines by Circuits / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0020-0190(90)90113-c / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2056373208 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:41, 30 July 2024

scientific article
Language Label Description Also known as
English
Efficient simulation of circuits by EREW PRAMs
scientific article

    Statements

    Efficient simulation of circuits by EREW PRAMs (English)
    0 references
    0 references
    1990
    0 references
    complexity theory
    0 references
    parallel random access machines
    0 references
    circuit complexity
    0 references
    matching problem
    0 references
    EREW PRAM
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references