Pages that link to "Item:Q3088193"
From MaRDI portal
The following pages link to On the Complexity of Computational Problems Regarding Distributions (Q3088193):
Displaying 14 items.
- AND-compression of NP-complete problems: streamlined proof and minor observations (Q309801) (← links)
- Bounds from a card trick (Q414410) (← links)
- An approximate distribution for the maximum order complexity (Q676727) (← links)
- Complexity of monotone modelling algorithms for discrete distributions (Q1204951) (← links)
- Statistical difference beyond the polarizing regime (Q2175943) (← links)
- (Q2941646) (← links)
- (Q3031890) (← links)
- New Limits to Classical and Quantum Instance Compression (Q3449566) (← links)
- (Q3686042) (← links)
- (Q4038696) (← links)
- (Q4796316) (← links)
- The Complexity and Distribution of Hard Problems (Q4834381) (← links)
- Minimum Circuit Size, Graph Isomorphism, and Related Problems (Q4993283) (← links)
- Communication Complexity of Statistical Distance (Q5002655) (← links)
