On the use of inaccessible numbers and order indiscernibles in lower bound arguments for random access machines (Q4732454)

From MaRDI portal
scientific article; zbMATH DE number 4118350
Language Label Description Also known as
English
On the use of inaccessible numbers and order indiscernibles in lower bound arguments for random access machines
scientific article; zbMATH DE number 4118350

    Statements

    On the use of inaccessible numbers and order indiscernibles in lower bound arguments for random access machines (English)
    0 references
    0 references
    1988
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    lower bound
    0 references
    algorithmic problems
    0 references
    ELEMENT DISTINCTNESS
    0 references
    DISJOINT SETS
    0 references
    Random Access Machines
    0 references
    oracles
    0 references
    RAM
    0 references
    decision tree
    0 references
    Ben-Or's lower bound
    0 references
    SET EQUALITY
    0 references
    0 references
    0 references