scientific article; zbMATH DE number 6783494
From MaRDI portal
Publication:5365141
zbMath1373.68237arXiv1010.3484MaRDI QIDQ5365141
Yi Wu, Ryan O'Donnell, Ilias Diakonikolas, Rocco A. Servedio
Publication date: 29 September 2017
Full work available at URL: https://arxiv.org/abs/1010.3484
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Learning and adaptive systems in artificial intelligence (68T05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (3)
A new central limit theorem and decomposition for Gaussian polynomials, with an application to deterministic approximate counting ⋮ Unnamed Item ⋮ Polynomial Threshold Functions, Hyperplane Arrangements, and Random Tensors
This page was built for publication:
