Results 111 to 120 of about 1,491,574 (265)
Finitely unstable theories and computational complexity
, 2014 The complexity class $NP$ can be logically characterized both through existential second order logic $SO\exists$, as proven by Fagin, and through simulating a Turing machine via the satisfiability problem of propositional logic SAT, as proven by Cook.
openaire +2 more sources
The Complexity of Infinite Computations In Models of Set Theory [PDF]
, 2009 Olivier Finkel
openalex +1 more source
An introduction to computational complexity and statistical learning theory applied to nuclear models [PDF]
, 2022 A. Idini
openalex +1 more source
npj Computational MaterialsTheoretical simulation of phase change materials such as Ge-Sb-Te has suffered from two methodological issues. On the one hand, there is a lack of efficient band gap correction method for density functional theory that is suitable for these materials in ...
Shanzhong Xie +8 more
doaj +1 more source
A Universal Scaling Theory for Complexity of Analog Computation [PDF]
, 2005 Yaniv S. Avizrats +2 more
openalex +1 more source
The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory
Journal of computer and system sciences (Print), 2009 Eric Allender +3 more
semanticscholar +1 more source