Optimal advice (Q672755): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Hemaspaandra, Lane A. / rank
Normal rank
 
Property / author
 
Property / author: Hemaspaandra, Lane A. / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0304-3975(95)00076-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2914018422 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantitative Relativizations of Complexity Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Qualitative relativizations of complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On sets Turing reducible to p-selective sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: PSPACE SURVIVES CONSTANT-WIDTH BOTTLENECKS / rank
 
Normal rank
Property / cites work
 
Property / cites work: P-selectivity: Intersections and indices / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(p\)-Selective sets and reducing search to decision vs. self-reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Solutions Uniquely Collapses the Polynomial Hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circuit-size lower bounds and non-reducibility to sparse sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Refining Nondeterminism in Relativized Polynomial-Time Bounded Computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turing machines that take advice / rank
 
Normal rank
Property / cites work
 
Property / cites work: On self-reducibility and weak P-selectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity-Restricted Advice Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Structure of Polynomial Time Reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: P-selective sets, tally languages, and the behavior of polynomial time reducibilities onNP / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:20, 27 May 2024

scientific article
Language Label Description Also known as
English
Optimal advice
scientific article

    Statements

    Optimal advice (English)
    0 references
    0 references
    0 references
    28 February 1997
    0 references
    P-selective sets
    0 references
    linear advice
    0 references

    Identifiers