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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2003299480 / 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
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:07, 28 May 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