Results 251 to 260 of about 8,682,077 (303)
Some of the next articles are maybe not open access.
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
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
Complexity Theory and Algorithms
2002The goal of algorithm design and complexity theory in parallel/distributed computing is to study efficient algorithms for (and limitations on the complexity of) problems, taking into account such parallel complexity measures as the number of processing nodes or the amount of communication, in addition to classical measures like time and space. Research
openaire +1 more source
Physical Review, 1953
A method for the calculation of the energy levels of an atom in terms of the experimentally observed energy levels of ions of higher ionization is developed. This method can be applied to a system of nonequivalent electrons, as well as equivalent electrons. The notion of fractional parentage is extended to systems of nonequivalent electrons.
openaire +1 more source
A method for the calculation of the energy levels of an atom in terms of the experimentally observed energy levels of ions of higher ionization is developed. This method can be applied to a system of nonequivalent electrons, as well as equivalent electrons. The notion of fractional parentage is extended to systems of nonequivalent electrons.
openaire +1 more source
Invitation to complexity theory
XRDS: Crossroads, The ACM Magazine for Students, 2012Complexity theory provides new viewpoints on various phenomena that were considered by past thinkers.
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
Parameterized Complexity Theory
Texts in Theoretical Computer Science. An EATCS Series, 2006J. Flum, Martin Grohe
semanticscholar +1 more source
Physical Review, 1942
The calculation of the coefficients of fractional parentage and of the energy matrices for the configurations ${f}^{n}$ is simplified very much by the use of the theory of groups. Tables of results are given.
openaire +2 more sources
The calculation of the coefficients of fractional parentage and of the energy matrices for the configurations ${f}^{n}$ is simplified very much by the use of the theory of groups. Tables of results are given.
openaire +2 more sources
Capturing the Complexity in Advanced Technology Use: Adaptive Structuration Theory
, 1994G. DeSanctis, M. S. Poole
semanticscholar +1 more source