- area complexity
- поверхностная сложность (алгоритма) (площадькристалла ИС как функция размерности задачи)
Большой англо-русский и русско-английский словарь. 2001.
area complexity
Смотреть что такое "area complexity" в других словарях:
Area denial weapons — are used to prevent an adversary from occupying or traversing an area of land. The specific method used does not have to be totally effective in preventing passage (and usually isn t) as long as it is sufficient to severely restrict, slow down,… … Wikipedia
Complexity economics — Economics … Wikipedia
Irreducible complexity — This article covers irreducible complexity as used by those who argue for intelligent design. For information on irreducible complexity as used in Systems Theory, see Irreducible complexity (Emergence). Irreducible complexity (IC) is an argument… … Wikipedia
Model of hierarchical complexity — The model of hierarchical complexity, is a framework for scoring how complex a behavior is. It quantifies the order of hierarchical complexity of a task based on mathematical principles of how the information is organized and of information… … Wikipedia
Model of Hierarchical Complexity — The model of hierarchical complexity is a framework for scoring how complex a behavior is. It quantifies the order of hierarchical complexity of a task based on mathematical principles of how the information is organized and of information… … Wikipedia
Kitzmiller v. Dover Area School District — United States District Court for the Middle District of Pennsylvania Argued September 26, 2005 November 4, 2005, Decided December 20, 2005 Full case name: Tammy Kitzmiller, et al. v. Dover Area School District, et al … Wikipedia
Information-based complexity — (IBC) studies optimal algorithms and computational complexity for the continuous problems which arise in physical science, economics, engineering, and mathematical finance. IBC has studied such continuous problems as path integration, partial… … Wikipedia
Kolmogorov complexity — In algorithmic information theory (a subfield of computer science), the Kolmogorov complexity of an object, such as a piece of text, is a measure of the computational resources needed to specify the object. It is named after Soviet Russian… … Wikipedia
Cyclomatic complexity — (or conditional complexity) is a software metric (measurement). It was developed by Thomas J. McCabe, Sr. in 1976 and is used to indicate the complexity of a program. It directly measures the number of linearly independent paths through a program … Wikipedia
Descriptive complexity theory — For other uses, see Kolmogorov complexity. Descriptive complexity is a branch of computational complexity theory and of finite model theory that characterizes complexity classes by the type of logic needed to express the languages in them. For… … Wikipedia
International Society for Complexity, Information, and Design — The International Society for Complexity, Information, and Design (ISCID) is a non profit professional society devoted to promoting intelligent design. [http://www.aaas.org/spp/dser/03 Areas/evolution/issues/peerreview.shtml Intelligent Design… … Wikipedia
