Results 231 to 240 of about 2,032,124 (281)
Some of the next articles are maybe not open access.
On the formalisation of Kolmogorov complexity
Proceedings of the 10th ACM SIGPLAN International Conference on Certified Programs and Proofs, 2021Kolmogorov complexity is an essential tool in the study of algorithmic information theory, and is used in the fields of Artificial Intelligence, cryptography, and coding theory.
E. Catt, Michael Norrish
semanticscholar +2 more sources
Kolmogorov Comes to Cryptomania: On Interactive Kolmogorov Complexity and Key-Agreement
IEEE Annual Symposium on Foundations of Computer Science, 2023Only a handful candidates for computational assumptions that imply secure key-agreement protocols (KA) are known, and even fewer are believed to be quantum safe.
Marshall Ball +3 more
semanticscholar +1 more source
, 2021
When wind turbine driving system (WTDS) undergoes abnormal conditions, the fault information hidden in WTDS scatters over multiple signal channels and hence inadequate for fault diagnosis only via fault information extraction of single-channel signal. To
Xiaoan Yan, Ying Liu, Yadong Xu, M. Jia
semanticscholar +1 more source
When wind turbine driving system (WTDS) undergoes abnormal conditions, the fault information hidden in WTDS scatters over multiple signal channels and hence inadequate for fault diagnosis only via fault information extraction of single-channel signal. To
Xiaoan Yan, Ying Liu, Yadong Xu, M. Jia
semanticscholar +1 more source
Cryptography from sublinear-time average-case hardness of time-bounded Kolmogorov complexity
Electron. Colloquium Comput. Complex., 2021Let MKtP[s] be the set of strings x such that Kt(x) ≤ s(|x|), where Kt(x) denotes the t-bounded Kolmogorov complexity of the truthtable described by x.
Yanyi Liu, R. Pass
semanticscholar +1 more source
Kolmogorov-Loveland Stochasticity and Kolmogorov Complexity
Theory of Computing Systems, 2007zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Unexpected hardness results for Kolmogorov complexity under uniform reductions
Electron. Colloquium Comput. Complex., 2020Hardness of computing the Kolmogorov complexity of a given string is closely tied to a security proof of hitting set generators, and thus understanding hardness of Kolmogorov complexity is one of the central questions in complexity theory. In this paper,
Shuichi Hirahara
semanticscholar +1 more source
Kolmogorov Complexity and Noncomputability
MLQ, 2002Summary: We use a method suggested by Kolmogorov complexity to examine some relations between Kolmogorov complexity and noncomputability. In particular we show that the method consistently gives us more information than conventional ways of demonstrating noncomputability (e.g. by embedding in the halting problem).
openaire +2 more sources
Axiomatizing Kolmogorov Complexity
Theory of Computing Systems, 2012zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Kolmogorov Complexity with Error
2006We introduce the study of Kolmogorov complexity with error. For a metric d, we define Ca(x) to be the length of a shortest program p which prints a string y such that d(x,y) ≤ a. We also study a conditional version of this measure Ca, b(x|y) where the task is, given a string y′ such that d(y,y′) ≤ b, print a string x′ such that d(x,x′) ≤ a.
L. Fortnow (Lance) +2 more
openaire +3 more sources