AND-compression of NP-complete problems: streamlined proof and minor observations (Q309801): Difference between revisions

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the Compressibility of $\mathcal{NP}$ Instances and Cryptographic Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Refinements of Pinsker's inequality / rank
 
Normal rank
Property / cites work
 
Property / cites work: A complete problem for statistical zero knowledge / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Computational Problems Regarding Distributions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023085 / rank
 
Normal rank

Latest revision as of 12:50, 12 July 2024

scientific article; zbMATH DE number 6482357
  • AND-compression of NP-complete Problems: Streamlined Proof and Minor Observations
Language Label Description Also known as
English
AND-compression of NP-complete problems: streamlined proof and minor observations
scientific article; zbMATH DE number 6482357
  • AND-compression of NP-complete Problems: Streamlined Proof and Minor Observations

Statements

AND-compression of NP-complete problems: streamlined proof and minor observations (English)
0 references
AND-compression of NP-complete Problems: Streamlined Proof and Minor Observations (English)
0 references
0 references
7 September 2016
0 references
15 September 2015
0 references

Identifiers

0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references