circuit+complexity

См. также в других словарях:

• 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

• Circuit (computer theory) — A circuit in computer theory is a theoretical structure simulating electrical and data paths, in which voltage and binary values enter at the beginning of the circuit, go through gates which do some computation and output an answer. An important… …   Wikipedia

• Circuit minimization — In Boolean algebra, circuit minimization is the problem of obtaining the smallest logic circuit (Boolean formula) that represents a given Boolean function or truth table. The general circuit minimization problem is believed to be intractable,[1]… …   Wikipedia

• Circuit — may mean: In science and technology Circuit theory, the theory of accomplishing work by routing electrons, gas, fluids, or other matter through a loop Pneumatic circuit Hydraulic circuit Boolean circuit circuit (computer theory) Integer circuit a …   Wikipedia

• complexity — /keuhm plek si tee/, n., pl. complexities for 2. 1. the state or quality of being complex; intricacy: the complexity of urban life. 2. something complex: the complexities of foreign policy. [1715 25; COMPLEX + ITY] * * * ▪ scientific theory… …   Universalium

• Circuit design — The process of circuit design can cover systems ranging from complex electronic systems all the way down to the individual transistors within an integrated circuit. For simple circuits the design process can often be done by one person without… …   Wikipedia

• Circuit ID — A circuit ID is a company specific identifier assigned to a data or voice network between two locations. This circuit, for example a tie line, is then leased to a customer by that ID. A subscriber having an issue with a circuit contacts the… …   Wikipedia

• Circuit-Value-Problem — Das Schaltkreis Auswertungsproblem (Circuit Value Problem, CVP) ist ein P vollständiges Problem. Es ähnelt stark dem Erfüllbarkeitsproblem der Aussagenlogik (SAT) mit dem Unterschied, dass bei diesem Problem keine geeignete Belegung erraten… …   Deutsch Wikipedia

• Circuit Value Problem — Das Schaltkreis Auswertungsproblem (Circuit Value Problem, CVP) ist ein P vollständiges Problem. Es ähnelt stark dem Erfüllbarkeitsproblem der Aussagenlogik (SAT) mit dem Unterschied, dass bei diesem Problem keine geeignete Belegung erraten… …   Deutsch 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

• 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