circuit hierarchy

circuit hierarchy
схемная иерархия

Англо-русский словарь технических терминов. 2005.

Игры ⚽ Поможем решить контрольную работу

Смотреть что такое "circuit hierarchy" в других словарях:

  • Circuit complexity — In theoretical computer science, circuit complexity is a branch of computational complexity theory in which Boolean functions are classified according to the size or depth of Boolean circuits that compute them. A Boolean circuit with n input bits …   Wikipedia

  • Polynomial hierarchy — In computational complexity theory, the polynomial hierarchy is a hierarchy of complexity classes that generalize the classes P, NP and co NP to oracle machines.DefinitionsThere are multiple equivalent definitions of the classes of the polynomial …   Wikipedia

  • United States Court of Appeals for the Ninth Circuit — Seal of the United States Court of Appeals for the Ninth Circuit The United States Court of Appeals for the Ninth Circuit (in case citations, 9th Cir.) is a U.S. federal court with appellate jurisdiction over the district courts in the following… …   Wikipedia

  • Standardized digital transmission rates for the synchronous digital hierarchy (SDH), the synchronous optical network (SONET), and the optical carrier (OC) hierarchy — ▪ Table Standardized digital transmission rates for the synchronous digital hierarchy (SDH), the synchronous optical network (SONET), and the optical carrier (OC) hierarchy* SDH system SONET system OC level transmission rate in megabits per… …   Universalium

  • Quite Universal Circuit Simulator — Infobox Software name = Quite Universal Circuit Simulator http://qucs.sourceforge.net/images/qucslogo4.pngQucs logo] caption = developer = Michael Margraf latest release version = 0.0.14 latest release date = 2008 04 10 latest preview version =… …   Wikipedia

  • 2010 ITF Men's Circuit — The 2010 ITF Men s Circuit consisted of 502 Futures tournaments played year round, around the world. Contents 1 Events 2 Top 25 players of the season 3 Point distribution 4 See also …   Wikipedia

  • NC (complexity) — Unsolved problems in computer science Is NC = P ? In complexity theory, the class NC (for Nick s Class ) is the set of decision problems decidable in polylogarithmic time on a parallel computer with a polynomial number of processors. In… …   Wikipedia

  • telephone — telephoner, n. /tel euh fohn /, n., v., telephoned, telephoning. n. 1. an apparatus, system, or process for transmission of sound or speech to a distant point, esp. by an electric device. v.t. 2. to speak to or summon (a person) by telephone. 3.… …   Universalium

  • T-carrier — In telecommunications, T carrier, sometimes abbreviated as T CXR , is the generic designator for any of several digitally multiplexed telecommunications carrier systems originally developed by Bell Labs and used in North America, Japan, and Korea …   Wikipedia

  • Network topology — Diagram of different network topologies. Network topology is the layout pattern of interconnections of the various elements (links, nodes, etc.) of a computer[1][2] …   Wikipedia

  • Computational complexity theory — is a branch of the theory of computation in theoretical computer science and mathematics that focuses on classifying computational problems according to their inherent difficulty, and relating those classes to each other. In this context, a… …   Wikipedia


Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»