Results 301 to 310 of about 8,702,509 (349)
Some of the next articles are maybe not open access.
Complexity Theory for Discrete Black-Box Optimization Heuristics
Theory of Evolutionary Computation, 2018A predominant topic in the theory of evolutionary algorithms and, more generally, theory of randomized black-box optimization techniques is running-time analysis.
Carola Doerr
semanticscholar +1 more source
Perspective: Complexity Theory and Organization Science
Organization science (Providence, R.I.), 1999Complex organizations exhibit surprising, nonlinear behavior. Although organization scientists have studied complex organizations for many years, a developing set of conceptual and computational tools makes possible new approaches to modeling nonlinear ...
Gérard P. Cachon +2 more
semanticscholar +1 more source
Results in Mathematics, 2005
Given \(A(z)\) entire, it is well known that all solutions of \[ y^{(k)}+A(z)y=0 \] are entire functions. The main result in the present paper is the following theorem: Suppose \(\rho(A)
openaire +2 more sources
Given \(A(z)\) entire, it is well known that all solutions of \[ y^{(k)}+A(z)y=0 \] are entire functions. The main result in the present paper is the following theorem: Suppose \(\rho(A)
openaire +2 more sources
Epistemologia. Rivista italiana di filosofia della scienza
From a formalist standpoint, the identity-relation is indifferent to the nature of its terms. In contrast, from a Hegelian standpoint, the properties of identity have their source in the kind of entity over which individual variables range. The author tries to capture the latter more logically complex, and ontologically differentiated, view in terms of
openaire +2 more sources
From a formalist standpoint, the identity-relation is indifferent to the nature of its terms. In contrast, from a Hegelian standpoint, the properties of identity have their source in the kind of entity over which individual variables range. The author tries to capture the latter more logically complex, and ontologically differentiated, view in terms of
openaire +2 more sources
Economic complexity theory and applications
Nature Reviews Physics, 2021César A. Hidalgo
semanticscholar +1 more source
Complexity Theory and Algorithms
2000This workshop embraces algorithmic and complexity theory issues in parallel computing. A total of 10 submissions were received. Three papers were accepted, two as regular papers, one as a research note.
Friedhelm Meyer auf der Heide +2 more
openaire +1 more source
1980
The established methodologies for studying computational complexity can be applied to the new problems posed by very large-scale integrated (VLSI) circuits. This thesis develops a ''VLSI model of computation'' and derives upper and lower bounds on the silicon area and time required to solve the problems of sorting and discrete Fourier transformation ...
openaire +1 more source
The established methodologies for studying computational complexity can be applied to the new problems posed by very large-scale integrated (VLSI) circuits. This thesis develops a ''VLSI model of computation'' and derives upper and lower bounds on the silicon area and time required to solve the problems of sorting and discrete Fourier transformation ...
openaire +1 more source
Complexity theory and genetics
Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory, 2002We introduce a population genetics model in which the operators are effectively computable-computable in polynomial time on probabilistic Turing machines. We shall show that in this model a population can encode easily large amount of information from environment into genetic code. Then it can process the information as a parallel computer.
openaire +1 more source
Computational Complexity Theory
2004Week One: Complexity theory: From Godel to Feynman Complexity theory: From Godel to Feynman History and basic concepts Resources, reductions and P vs. NP Probabilistic and quantum computation Complexity classes Space complexity and circuit complexity Oracles and the polynomial time hierarchy Circuit lower bounds "Natural" proofs of lower bounds ...
openaire +1 more source
ON DIMENSION THEORY FOR COMPLEXES
Mathematics of the USSR-Sbornik, 1980Passage from the category of modules to the derived category gives insight into some classical results of homological dimension theory, and also yields a proof of the nondegeneracy of the Yoneda multiplication, where the argument is a noetherian module (or a finite complex with noetherian homology) and is a regular local ring. Bibliography: 9 titles.
openaire +3 more sources