Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Information distance and conditional complexities

From MaRDI portal
Publication:5958288
Jump to:navigation, search

DOI10.1016/S0304-3975(01)00037-8zbMath0992.68084MaRDI QIDQ5958288

Michael V. Vyugin

Publication date: 3 March 2002

Published in: Theoretical Computer Science (Search for Journal in Brave)


zbMATH Keywords

information distanceKolmogorov conditional complexity


Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)


Related Items

INFORMATION DISTANCE AND ITS APPLICATIONS, Nonapproximability of the normalized information distance, Topological arguments for Kolmogorov complexity



Cites Work

  • Information distance
  • Unnamed Item
  • Unnamed Item
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5958288&oldid=12127905"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 02:24.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki