AM\(_{\text{exp}}\nsubseteq (\text{NP} \cap \text{coNP})\)/poly (Q1029043): 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.ipl.2003.09.011 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2000249261 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New lowness results for ZPP\(^{\text{NP}}\) and other complexity classes. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof verification and the hardness of approximation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-deterministic exponential time has two-prover interactive protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4258566 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4418679 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An oracle builder's toolkit / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong and robustly strong polynomial-time reducibilities to sparse sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On relativized exponential and probabilistic complexity classes / 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: New Collapse Consequences of NP Having Small Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic methods for interactive proof systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong nondeterministic polynomial-time reducibilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4938667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / 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: IP = PSPACE / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:03, 1 July 2024

scientific article
Language Label Description Also known as
English
AM\(_{\text{exp}}\nsubseteq (\text{NP} \cap \text{coNP})\)/poly
scientific article

    Statements

    AM\(_{\text{exp}}\nsubseteq (\text{NP} \cap \text{coNP})\)/poly (English)
    0 references
    9 July 2009
    0 references
    computational complexity
    0 references
    nonuniform computation
    0 references
    lower bound
    0 references
    relativization
    0 references

    Identifiers