Proof Compression and NP Versus PSPACE II: Addendum
Bulletin of the Section of Logic, 2022 In our previous work we proved the conjecture NP = PSPACE by advanced proof theoretic methods that combined Hudelmaier’s cut-free sequent calculus for minimal logic (HSC) with the horizontal compressing in the corresponding minimal Prawitz-style natural ...
Lew Gordeev, Edward Hermann Haeusler
doaj +1 more source
Nonequilibrium statistical mechanics and optimal prediction of partially-observed complex systems
New Journal of Physics, 2022 Only a subset of degrees of freedom are typically accessible or measurable in real-world systems. As a consequence, the proper setting for empirical modeling is that of partially-observed systems.
Adam Rupe +2 more
doaj +1 more source
P Systems with Evolutional Communication and Division Rules
Axioms, 2021 A widely studied field in the framework of membrane computing is computational complexity theory. While some types of P systems are only capable of efficiently solving problems from the class P, adding one or more syntactic or semantic ingredients to ...
David Orellana-Martín +2 more
doaj +1 more source
Computational Creativity and Aesthetics with Algorithmic Information Theory
Entropy, 2021 We build an analysis based on the Algorithmic Information Theory of computational creativity and extend it to revisit computational aesthetics, thereby, improving on the existing efforts of its formulation.
Tiasa Mondol, Daniel G. Brown
doaj +1 more source
Computational complexity of vacua and near-vacua in field and string theory [PDF]
Physical Review D, 2018 We demonstrate that the problems of finding stable or metastable vacua in a low energy effective field theory requires solving nested NP-hard and co-NP-hard problems, while the problem of finding near-vacua is in P.
James Halverson, Fabian Ruehle
semanticscholar +1 more source
Proof of the Theory-to-Practice Gap in Deep Learning via Sampling Complexity bounds for Neural Network Approximation Spaces [PDF]
Foundations of Computational Mathematics, 2021 We study the computational complexity of (deterministic or randomized) algorithms based on point samples for approximating or integrating functions that can be well approximated by neural networks.
P. Grohs, F. Voigtlaender
semanticscholar +1 more source
A Computational Turn in Policy Process Studies: Coevolving Network Dynamics of Policy Change
Complexity, 2022 The past three decades of policy process studies have seen the emergence of a clear intellectual lineage with regard to complexity. Implicitly or explicitly, scholars have employed complexity theory to examine the intricate dynamics of collective action ...
Maxime Stauffer +5 more
doaj +1 more source
Boundaries of computational complexity and optimal cluster’s quantity for controlled swarm in non-cooperative games [PDF]
Известия высших учебных заведений: Прикладная нелинейная динамика, 2021 The purpose of the work is to determine the relationship between the computational complexity of controlling a swarm of particles and the available computational resources for choosing the optimal control strategy.
Kiselev, Oleg Михайлович
doaj +1 more source
The Computational Complexity of Plethysm Coefficients [PDF]
Computational Complexity, 2020 In two papers, Bürgisser and Ikenmeyer (STOC 2011, STOC 2013) used an adaption of the geometric complexity theory (GCT) approach by Mulmuley and Sohoni (Siam J Comput 2001, 2008) to prove lower bounds on the border rank of the matrix multiplication ...
N. Fischer, Christian Ikenmeyer
semanticscholar +1 more source
Study of blockchain's consensus mechanism based on score
IET Blockchain, 2021 The consensus mechanism is a key technology to achieve state consistency among distributed nodes and it determines the consensus efficiency and stability of the blockchain system.
Shaobin Cai +3 more
doaj +1 more source