On complexity of easy predictable sequences
type: Item
instance of: scholarly article
title: On complexity of easy predictable sequences
zbMATH Open document ID: 1012.68090
DOI: 10.1016/S0890-5401(02)93164-0
author: Michael V. Vyugin
author: Vladimir V. V'yugin
published in: Information and Computation
publication date: 2003-01-14T00:00:00Z
Mathematics Subject Classification ID: 68Q30
Mathematics Subject Classification ID: 68T05
zbMATH DE Number: 1853290
MaRDI profile type: Publication
cites work: How to use expert advice
cites work: Q3619797
cites work: Q4955322
cites work: Q4337021
cites work: Q5573961
cites work: A game of prediction with expert advice
cites work: Complexity Approximation Principle
cites work: THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
cites work: Most sequences are stochastic
cites work: Q4473554
full work available at URL: s0890-5401(02)93164-0
OpenAlex ID: W1964796174
description: scientific article; zbMATH DE number 1853290