Zobrazeno 1 - 10
of 29 130
pro vyhledávání: '"COMPLEXITY MEASURES"'
Many natural phenomena are characterized by self-similarity, for example the symmetry of human faces, or a repetitive motif of a song. Studying of such symmetries will allow us to gain deeper insights into the underlying mechanisms of complex systems
Externí odkaz:
http://arxiv.org/abs/2411.19713
Finding reliable approximations to the quantum many-body problem is one of the central challenges of modern physics. Elemental to this endeavor is the development of advanced numerical techniques pushing the limits of what is tractable. One such rece
Externí odkaz:
http://arxiv.org/abs/2411.04527
A number of complexity measures for Boolean functions have previously been introduced. These include (1) sensitivity, (2) block sensitivity, (3) witness complexity, (4) subcube partition complexity and (5) algorithmic complexity. Each of these is con
Externí odkaz:
http://arxiv.org/abs/2408.12995
A good process model is expected not only to reflect the behavior of the process, but also to be as easy to read and understand as possible. Because preferences vary across different applications, numerous measures provide ways to reflect the complex
Externí odkaz:
http://arxiv.org/abs/2408.09871
In a recent result, Knop, Lovett, McGuire and Yuan (STOC 2021) proved the log-rank conjecture for communication complexity, up to log n factor, for any Boolean function composed with AND function as the inner gadget. One of the main tools in this res
Externí odkaz:
http://arxiv.org/abs/2406.07859
Autor:
Li, Chunlei
Publikováno v:
Cryptography, 2024
Since the introduction of the Kolmogorov complexity of binary sequences in the 1960s, there have been significant advancements in the topic of complexity measures for randomness assessment, which are of fundamental importance in theoretical computer
Externí odkaz:
http://arxiv.org/abs/2405.08479
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Precious O. Amadi, Suryadi Suryadi, Norshamsuri Ali, Syed Alwee Aljunid, Rosdisham Endut, Mohd Aminudin Jamlos, Akpan N. Ikot
Publikováno v:
Results in Physics, Vol 65, Iss , Pp 107963- (2024)
Using the screening potential, we explore probability density properties in interstellar mediums (ISM) in information theory. With the eigenfunctions obtained for the screening potential using the Schrodinger equation, we studied the probability dist
Externí odkaz:
https://doaj.org/article/aac9299606b54867bce333b4be78eb71
In statistical learning theory, a generalization bound usually involves a complexity measure imposed by the considered theoretical framework. This limits the scope of such bounds, as other forms of capacity measures or regularizations are used in alg
Externí odkaz:
http://arxiv.org/abs/2402.13285