Lower bounds for recognizing small cliques on CRCW PRAM's (Q919820): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: \(\Sigma_ 1^ 1\)-formulae on finite structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: First-order definability on finite structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limits on the power of concurrent-write parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal bounds for decision problems on the CRCW PRAM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3682518 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4065548 / 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: Q4728251 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on the size of bounded depth circuits over a complete basis with logical addition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulation of Parallel Random Access Machines by Circuits / rank
 
Normal rank

Revision as of 10:00, 21 June 2024

scientific article
Language Label Description Also known as
English
Lower bounds for recognizing small cliques on CRCW PRAM's
scientific article

    Statements

    Lower bounds for recognizing small cliques on CRCW PRAM's (English)
    0 references
    1990
    0 references
    lower bounds
    0 references
    cliques
    0 references
    models of computation
    0 references
    CRCW PRAM
    0 references
    fan-in circuits
    0 references
    constant-depth circuits
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references