Sparse hard sets for P: Resolution of a conjecture of Hartmanis (Q1288202): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q56092494, #quickstatements; #temporary_batch_1707303357582
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1006/jcss.1998.1615 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1985877037 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Parallel Algorithm for Formula Evaluation / 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: Q3719722 / 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: Q4364576 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant Depth Reducibility / 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: A Note on Sparse Complete Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / 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: Space-efficient recognition of sparse self-reducible languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relating Equivalence and Reducibility to Sparse Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nondeterministic Space is Closed under Complementation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turing machines that take advice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse complete sets for NP: solution of a conjecture of Berman and Hartmanis / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast parallel algorithm to compute the rank of a matrix over an arbitrary field / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small-Bias Probability Spaces: Efficient Constructions and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252720 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-Time Bounded Truth-Table Reducibility of NP Sets to Sparse Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3815544 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3946078 / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/jcss/CaiS99 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1006/JCSS.1998.1615 / rank
 
Normal rank

Latest revision as of 17:31, 10 December 2024

scientific article
Language Label Description Also known as
English
Sparse hard sets for P: Resolution of a conjecture of Hartmanis
scientific article

    Statements

    Sparse hard sets for P: Resolution of a conjecture of Hartmanis (English)
    0 references
    0 references
    11 May 1999
    0 references
    space sets
    0 references

    Identifiers