Algebraic barriers to halving algorithmic information quantities in correlated strings

A preliminary version of the paper was published in proceedings of the 50th International Symposium on Mathematical Foundations of Computer Science (MFCS 2025), https://mfcs2025.mimuw.edu.pl/ ; DOI:10.4230/LIPIcs.MFCS.2025.84, https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2025.84

Authors

Andrei Romashchenko (ORCID: https://orcid.org/0000-0001-7723-7880)

Publication Details

Journal: Information and Computation
Published: 2025-12-05
DOI: https://doi.org/10.1016/j.ic.2025.105396
Primary Topic: Computability, Logic, AI Algorithms
Type: article
Field-Weighted Citation Impact: 0.00

Controls

|||

ALL TIME

JAN

FEB

MAR

APR

MAY

JUN

JUL

AUG

SEP

OCT

article

Algebraic barriers to halving algorithmic information quantities in correlated strings

Andrei Romashchenko

Dec 5, 2025

Information and Computation

Computability, Logic, AI Algorithms

article

Algebraic barriers to halving algorithmic information quantities in correlated strings

Andrei Romashchenko

December 5, 2025article en

Abstract

Information and ComputationVol. 308

Openalex Percentile: Top 62%

Computability, Logic, AI Algorithms

DOI Open Access PDF OpenAlex

AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Algebraic barriers to halving algorithmic information quantities in correlated strings — Andrei Romashchenko · Information and Computation (2025) | TGRS Research Map | TGRS