Resolution of Hartmanis' conjecture for NL-hard sparse sets (Q1575434): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / 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: On the existence of hard sparse sets under weak reductions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4359456 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252721 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant Depth Reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Very Fast Parallel Polynomial Arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parity, circuits, and the polynomial-time hierarchy / 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: Languages that Capture Complexity Classes / 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: 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: Inverting a Vandermonde matrix in minimum parallel time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maze recognizing automata and nondeterministic tape complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040892 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3815544 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3946078 / rank
 
Normal rank

Revision as of 13:12, 30 May 2024

scientific article
Language Label Description Also known as
English
Resolution of Hartmanis' conjecture for NL-hard sparse sets
scientific article

    Statements

    Resolution of Hartmanis' conjecture for NL-hard sparse sets (English)
    0 references
    0 references
    21 August 2000
    0 references
    0 references
    sparse sets
    0 references
    isomorphism conjecture
    0 references
    nondeterministic space
    0 references
    circuit complexity
    0 references
    algebraic computation
    0 references
    0 references