scientific article; zbMATH DE number 7359365

DOI10.4230/LIPIcs.ITCS.2018.28zbMath1462.68161MaRDI QIDQ4993292

Michal Moshkovitz, Dana Moshkovitz

Publication date: 15 June 2021

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

learningmixingcertaintyspace boundentropy sampler

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

Statistical-computational trade-offs in tensor PCA and related problems via communication complexity ⋮ Time-space lower bounds for two-pass learning

Cites Work

• Unnamed Item
• Unnamed Item
• Improved approximation algorithms for projection games
• Exact bounds for some hypergraph saturation problems
• Time-space hardness of learning sparse parities

This page was built for publication: