The relative complexity of NP search problems (Q1273858): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(5 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1006/jcss.1998.1575 / rank
Normal rank
 
Property / author
 
Property / author: P. W. Beame / rank
Normal rank
 
Property / author
 
Property / author: Stephen A. Cook / rank
Normal rank
 
Property / author
 
Property / author: P. W. Beame / rank
 
Normal rank
Property / author
 
Property / author: Stephen A. Cook / 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.1006/jcss.1998.1575 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2037028865 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tight relationship between generic oracles and type-2 complexity theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-witnessing polynomial-time complexity and prime factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-way functions and the nonisomorphism of NP-complete sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: How easy is local search? / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of the parity argument and other inefficient proofs of existence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every Prime Has a Succinct Certificate / rank
 
Normal rank
Property / cites work
 
Property / cites work: Query complexity, or why is it difficult to separate \(NP^ A\cap coNP^ A\) from \(P^ A\) by random oracles A? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity for type-2 relations / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1006/JCSS.1998.1575 / rank
 
Normal rank

Latest revision as of 17:16, 10 December 2024

scientific article
Language Label Description Also known as
English
The relative complexity of NP search problems
scientific article

    Statements

    Identifiers