On O(Tlog T) reduction from RAM computations to satisfiability (Q758197): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0304-3975(91)90177-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1969514863 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sorting in \(c \log n\) parallel steps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short propositional formulas represent nondeterministic computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3742714 / rank
 
Normal rank

Latest revision as of 16:07, 21 June 2024

scientific article
Language Label Description Also known as
English
On O(Tlog T) reduction from RAM computations to satisfiability
scientific article

    Statements

    On O(Tlog T) reduction from RAM computations to satisfiability (English)
    0 references
    1991
    0 references
    0 references
    0 references
    0 references
    0 references
    satisfiability
    0 references
    random access machines
    0 references
    reduction
    0 references
    0 references