The following pages link to Nikolai K. Vereshchagin (Q1275007):
Displaying 50 items.
- (Q235576) (redirect page) (← links)
- Algorithmic minimal sufficient statistics: a new approach (Q285518) (← links)
- Towards a reverse Newman's theorem in interactive information complexity (Q343858) (← links)
- Insuring against loss of evidence in game-theoretic probability (Q618027) (← links)
- Test martingales, Bayes factors and \(p\)-values (Q635415) (← links)
- Partitioning multi-dimensional sets in a small number of ``uniform'' parts (Q854815) (← links)
- New proof of the solvability of the elementary theory of linearly ordered sets (Q923067) (← links)
- On abstract resource semantics and computability logic (Q980944) (← links)
- Occurrence of zero in a linear recursive sequence (Q1077447) (← links)
- Randomized Boolean decision trees: Several remarks (Q1275008) (← links)
- A general method to construct oracles realizing given relationships between complexity classes (Q1351504) (← links)
- Do stronger definitions of randomness exist? (Q1401207) (← links)
- How to use several noisy channels with unknown error probabilities (Q1401948) (← links)
- Inequalities for Shannon entropy and Kolmogorov complexity (Q1567410) (← links)
- Encoding invariance in average case complexity (Q1678756) (← links)
- Short lists with short programs from programs of functions and strings (Q1694012) (← links)
- Short lists with short programs in short time (Q1745959) (← links)
- Sparse selfreducible sets and nonuniform lower bounds (Q1755786) (← links)
- Limit complexities revisited (Q1959396) (← links)
- Arthur-Merlin games in Boolean decision trees (Q1961380) (← links)
- On the structure of Ammann A2 tilings (Q1985295) (← links)
- How much randomness is needed to convert MA protocols to AM protocols? (Q2097236) (← links)
- Proofs of conservation inequalities for Levin's notion of mutual information of 1974 (Q2219055) (← links)
- Does the polynomial hierarchy collapse if onto functions are invertible? (Q2268347) (← links)
- Descriptive complexity of computable sequences revisited (Q2290652) (← links)
- Kolmogorov complexity of enumerating finite sets (Q2379938) (← links)
- Non-reducible descriptions for conditional Kolmogorov complexity (Q2382285) (← links)
- Kolmogorov-Loveland stochasticity for finite strings (Q2390324) (← links)
- A new class of non-Shannon-type inequalities for entropies (Q2493516) (← links)
- On joint conditional complexity (entropy) (Q2510760) (← links)
- Individual communication complexity (Q2643018) (← links)
- High entropy random selection protocols (Q2659776) (← links)
- A family of non-periodic tilings of the plane by right golden triangles (Q2671174) (← links)
- Information disclosure in the framework of Kolmogorov complexity (Q2699959) (← links)
- (Q2757852) (← links)
- Algorithmic Statistics Revisited (Q2805729) (← links)
- Algorithmic Statistics: Forty Years Later (Q2970987) (← links)
- (Q3020318) (← links)
- (Q3020324) (← links)
- Kolmogorov Complexity and Model Selection (Q3392938) (← links)
- (Q3396628) (← links)
- (Q3433902) (← links)
- Shannon Entropy vs. Kolmogorov Complexity (Q3434702) (← links)
- Inverting Onto Functions and Polynomial Hierarchy (Q3499770) (← links)
- On Game Semantics of the Affine and Intuitionistic Logics (Q3511445) (← links)
- On-Line Probability, Complexity and Randomness (Q3529916) (← links)
- Kolmogorov's Structure Functions and Model Selection (Q3547751) (← links)
- An Encoding Invariant Version of Polynomial Time Computable Distributions (Q3569762) (← links)
- Algorithmic Minimal Sufficient Statistic Revisited (Q3576086) (← links)
- High Entropy Random Selection Protocols (Q3603478) (← links)
