scientific article

zbMATH Open0574.68035MaRDI QIDQ3692863

Ivan Kramosil

Publication date: 1985

Title of this publication is not available (Why is that?)

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Parametric hypothesis testing (62F03)

Related Items (3)

Quick testing of random sequences ⋮ Title not available (Why is that?) ⋮ Two variants of Lempel - Ziv test for binary sequences

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• A computable measure of algorithmic probability by finite approximations with an application to integer sequences 👍 👎
• Algorithmic tests and randomness with respect to a class of measures 👍 👎
• Exact computation for some sequential tests 👍 👎
• Algorithmic Complexity and Stochastic Properties of Finite Binary Sequences 👍 👎

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3692863)