The following pages link to Dmitriy Kunisky (Q2098295):
Displaying 18 items.
- Dual bounds for the positive definite functions approach to mutually unbiased bases (Q2098296) (← links)
- Notes on computational hardness of hypothesis testing: predictions using the low-degree likelihood ratio (Q2103494) (← links)
- A tight degree 4 sum-of-squares lower bound for the Sherrington-Kirkpatrick Hamiltonian (Q2235162) (← links)
- The Average-Case Time Complexity of Certifying the Restricted Isometry Property (Q5032580) (← links)
- (Q5875785) (← links)
- The Discrepancy of Unsatisfiable Matrices and a Lower Bound for the Komlós Conjecture Constant (Q6158363) (← links)
- The Spectrum of the Grigoriev–Laurent Pseudomoments (Q6187076) (← links)
- Linear Programming and Community Detection (Q6199276) (← links)
- Computational Hardness of Certifying Bounds on Constrained PCA Problems (Q6314315) (← links)
- Low coordinate degree algorithms I: Universality of computational thresholds for hypothesis testing (Q6525806) (← links)
- Computational hardness of detecting graph lifts and certifying lift-monotone properties of random regular graphs (Q6532118) (← links)
- Tensor cumulants for statistical inference on invariant distributions (Q6532529) (← links)
- Subexponential-time algorithms for sparse PCA (Q6566150) (← links)
- Strong recovery of geometric planted matchings (Q6575109) (← links)
- A degree 4 sum-of-squares lower bound for the clique number of the Paley graph (Q6640367) (← links)
- Optimality of Glauber dynamics for general-purpose Ising model sampling and free energy approximation (Q6645552) (← links)
- On the concentration of Gaussian Cayley matrices (Q6657426) (← links)
- Fitting an ellipsoid to random points: predictions using the replica method (Q6670187) (← links)
