Resource bounded immunity and simplicity (Q2576870): 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 / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2005.03.055 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1974993202 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diagonalizations over polynomial time computable sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4734760 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simplicity, Relativizations and Nondeterminism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3996675 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bi-immune sets for complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relative to a Random Oracle<i>A</i>, ${\bf P}^A \ne {\bf NP}^A \ne \text{co-}{\bf NP}^A $ with Probability 1 / 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: Strong separations of the polynomial hierarchy with oracles: Constructive separations by immune and simple sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Boolean Hierarchy I: Structural Properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4942157 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generic separations / rank
 
Normal rank
Property / cites work
 
Property / cites work: TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3801071 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Defying upward and downward separation / 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: Strong self-reducibility precludes strong immunity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classes bounded by incomplete sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On simple and creative sets in NP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Oracle-dependent properties of the lattice of NP sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some remarks on witness functions for nonpolynomial and noncomplete sets in NP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlevelable sets and immune sets in the accepting density hierarchy inNP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completeness, Approximation and Density / 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: On Reducibility to Complex or Sparse Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3232283 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on balanced immunity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A classification of complexity core lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Instance complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Approximations and Polynomially Levelable Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursively enumerable sets of positive integers and their decision problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Immunity and Simplicity for Exact Counting and Other Counting Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3770515 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A low and a high hierarchy within NP / 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
Property / cites work
 
Property / cites work: A taxonomy of complexity classes of functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The polynomial-time hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: A second step toward the strong polynomial-time hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simplicity, immunity, relativizations and nondeterminism / rank
 
Normal rank
Property / cites work
 
Property / cites work: [Russian Text Ignored] / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relative complexity of checking and evaluating / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete sets and the polynomial-time hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structural properties for feasibly computable classes of type two / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:30, 11 June 2024

scientific article
Language Label Description Also known as
English
Resource bounded immunity and simplicity
scientific article

    Statements

    Resource bounded immunity and simplicity (English)
    0 references
    0 references
    0 references
    29 December 2005
    0 references
    immune set
    0 references
    simple set
    0 references
    complete set
    0 references
    weak forcing
    0 references
    generic oracle
    0 references
    random oracle
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers