Limitations of Efficient Reducibility to the Kolmogorov Random Strings

Computability - Netherlands
doi 10.3233/com-2012-006
Full Text
Abstract

Available in full text

Date
Authors
Publisher

IOS Press

Related search

Random Access to Grammar-Compressed Strings

2011English

Random Access to Grammar-Compressed Strings and Trees

SIAM Journal on Computing
MathematicsComputer Science
2015English

The Direct and Reverberant Response of Strings and Membranes to Convecting, Random Pressure Fields

Journal of the Acoustical Society of America
AcousticsUltrasonicsArtsHumanities
1972English

Divertible Zero Knowledge Interactive Proofs and Commutative Random Self-Reducibility

English

Random Strings and Tt-Degrees of Turing Complete C.E. Sets

Logical Methods in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Introduction to Strings

1999English

Variant Monte Carlo Algorithm for Driven Elastic Strings in Random Media

Computer Physics Communications
HardwareAstronomyPhysicsArchitecture
2005English

Games Orbits Play and Obstructions to Borel Reducibility

Groups, Geometry, and Dynamics
CombinatoricsGeometryTopologyDiscrete Mathematics
2018English

An Algebraic Approach to the Kolmogorov-Sinai Entropy

Reviews in Mathematical Physics
Nonlinear PhysicsMathematical PhysicsStatistical
1996English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy