Results 11 to 20 of about 1,379,053 (353)
Assembly theory and its relationship with computational complexity [PDF]
npj ComplexityAssembly theory (AT) quantifies selection using the assembly equation, identifying complex objects through the assembly index, the minimal steps required to build an object from basic parts, and copy number, the observed instances of the object.
Christopher P. Kempes +6 more
doaj +6 more sources
Computational Complexity Theory and the Philosophy of Mathematics† [PDF]
Philosophia Mathematica, 2019 AbstractComputational complexity theory is a subfield of computer science originating in computability theory and the study of algorithms for solving practical mathematical problems. Amongst its aims is classifying problems by their degree of difficulty — i.e., how hard they are to solve computationally.
Walter Dean
semanticscholar +4 more sources
A Computational Complexity Theory in Membrane Computing [PDF]
Workshop on Membrane Computing, 2010 Ministerio de Educación y Ciencia TIN2006 ...
M. Pérez-Jiménez
semanticscholar +7 more sources
Probabilistic Recursion Theory and Implicit Computational Complexity [PDF]
Scientific Annals of Computer Science, 2014 We show that probabilistic computable functions, i.e., those func- tions outputting distributions and computed by probabilistic Turing machines, can be characterized by a natural generalization of Church and Kleene’s partial recursive functions.
U. Dal Lago, S. Zuppiroli, M. Gabbrielli
doaj +8 more sources
Computational complexity of interacting electrons and fundamental limitations of density functional theory [PDF]
, 2009 Using arguments from computational complexity theory, fundamental limitations are found for how efficient it is to calculate the ground-state energy of many-electron systems using density functional theory.
Norbert Schuch, Frank Verstraete
semanticscholar +7 more sources
Relativization of the Theory of Computational Complexity [PDF]
Transactions of the American Mathematical Society, 1976 Blum''s machine-independent treatment of the complexity of partial recursive functions is extended to relative algorithms (as represented by Turing machines with oracles). We prove relativizations of several results of Blum complexity theory, such as the compression theorem.
Nancy Lynch +2 more
+4 more sources
An Overview of the Theory of Computational Complexity [PDF]
Journal of the ACM, 1971 The purpose of this paper is to outline the theory of computational complexity which has emerged as a comprehensive theory during the last decade. This theory is concerned with the quantitative aspects of computations and its central theme is the measuring of the difficulty of computing functions.
Juris Hartmanis, John E. Hopcroft
openaire +4 more sources
A universal scaling theory for complexity of analog computation [PDF]
Physics Letters A, 2007 4 pages, 2 eps ...
Yaniv S. Avizrats +2 more
openalex +4 more sources
The Computational Complexity of Density Functional Theory [PDF]
, 2014 Contributed chapter to "Many-Electron Approaches in Physics, Chemistry and Mathematics: A Multidisciplinary View"
Frank Verstraete +2 more
openaire +4 more sources
Provable conditions in computational complexity theory [PDF]
Bulletin of the Australian Mathematical Society, 1985 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Daryel Sachse-Åkerlind
openalex +4 more sources