Sparse sets, approximable sets, and parallel queries to NP (Q294651): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Jacobo Toran / rank
Normal rank
 
Property / author
 
Property / author: Jacobo Toran / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q15 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 03D15 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q17 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6594036 / rank
 
Normal rank
Property / zbMATH Keywords
 
computational complexity
Property / zbMATH Keywords: computational complexity / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4230375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds for the complexity of sparse and tally descriptions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4039803 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximable sets / 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 sparse set conjecture for sets with low density / 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: Computing functions with parallel queries to NP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-Time Membership Comparable Sets / 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: Q4258565 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two Results on Polynomial Time Truth-Table Reductions to Sparse Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP is as easy as detecting unique solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some consequences of non-uniform conditions on uniform classes / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2019844719 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:00, 30 July 2024

scientific article
Language Label Description Also known as
English
Sparse sets, approximable sets, and parallel queries to NP
scientific article

    Statements

    Identifiers