Prediction from partial information and hindsight, an alternative proof
type: Item
instance of: scholarly article
title: Prediction from partial information and hindsight, an alternative proof
zbMATH Open document ID: 1425.68130
author: Alexander V. Smal
author: Navid Talebanfard
published in: Information Processing Letters
publication date: 2018-05-25T00:00:00Z
Mathematics Subject Classification ID: 68Q15
Mathematics Subject Classification ID: 68P30
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68Q87
zbMATH DE Number: 6873297
zbMATH Keywords: certificate complexity
zbMATH Keywords: circuit complexity
zbMATH Keywords: computational complexity
zbMATH Keywords: information theory
zbMATH Keywords: query complexity
MaRDI profile type: MaRDI publication profile
full work available at URL: j.ipl.2018.04.011
OpenAlex ID: W2801462386
cites work: An improved exponential-time algorithm for k -SAT
cites work: Q4484662
Wikidata QID: Q129940261
DOI: 10.1016/J.IPL.2018.04.011
Recommended article: Prediction from partial information and hindsight, with application to circuit lower bounds
Recommended article: On some aspects of prediction theory
Recommended article: Q3814490
Recommended article: Predictability: An Information-Theoretic Perspective
Recommended article: On the ``prediction'' problem
Recommended article: Two problems in prediction theory
Recommended article: The Limits of Predicativity Revisited
Recommended article: A notion of coherent conditional prevision for arbitrary random quantities
description: scientific article; zbMATH DE number 6873297