Deterministic and randomized bounded truth-table reductions of P, NL, and L to sparse sets (Q1276171): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1006/jcss.1998.1589 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Q4256649 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4321931 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Isomorphisms and Density of $NP$ and Other Complete Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast parallel matrix and GCD computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the existence of hard sparse sets under weak reductions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252721 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A taxonomy of problems with fast parallel algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Problems complete for deterministic logarithmic space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Very Fast Parallel Polynomial Arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: On log-tape isomorphisms of complete sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On reductions of NP sets to sparse sets / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1006/JCSS.1998.1589 / rank
 
Normal rank

Latest revision as of 17:17, 10 December 2024

scientific article
Language Label Description Also known as
English
Deterministic and randomized bounded truth-table reductions of P, NL, and L to sparse sets
scientific article

    Statements

    Identifiers