boolean circuits造句

例句与造句

1. H錽tad's thesis and G鰀el Prize ( 1994 ) concerned his work on lower bounds on the size of constant-depth Boolean circuits for the parity function.
2. After the configuration decomposes into particles, the scaffolding intercepts those particles, and uses them as the input to a system of Boolean circuits constructed within the scaffolding.
3. As a special case, a propositional formula or Boolean expression is a Boolean circuit with a single output node in which every other node has fan-out of 1.
4. TC 0 contains all languages which are decided by Boolean circuits with constant depth and polynomial size, containing only unbounded-fanin AND gates, OR gates, NOT gates, and majority gates.
5. Because of this equivalence, "'P / poly "'is sometimes defined as the class of decision problems solvable by polynomial size Boolean circuits, or by polynomial-size non-uniform Boolean circuits.
6. It's difficult to find boolean circuits in a sentence. 用boolean circuits造句挺难的
7. Because of this equivalence, "'P / poly "'is sometimes defined as the class of decision problems solvable by polynomial size Boolean circuits, or by polynomial-size non-uniform Boolean circuits.
8. Boolean circuits are one of the prime examples of so-called non-uniform resource-bounded Turing machine that, on input " n ", produces a description of the individual circuit C _ n.
9. Informally, ACC 0 models the class of computations realised by Boolean circuits of constant depth and polynomial size, where the circuit gates includes " modular counting gates " that compute the number of true inputs modulo some fixed constant.
10. Equivalently, "'NC "'can be defined as those decision problems decidable by a uniform Boolean circuit ( which can be calculated from the length of the input ) with polylogarithmic depth and a polynomial number of gates.
11. A language " L " is in P if and only if there exists a polynomial-time uniform family of boolean circuits \ { C _ n : n \ in \ mathbb { N } \ }, such that
12. The case of boolean circuits cannot be derived from this case ( since it involves deciding potentially undecidable problems ), but the proof of Adleman's theorem can be easily adapted to the case of non-uniform boolean circuits families.
13. The case of boolean circuits cannot be derived from this case ( since it involves deciding potentially undecidable problems ), but the proof of Adleman's theorem can be easily adapted to the case of non-uniform boolean circuits families.
14. In 1980, along with Richard J . Lipton, Karp proved the Karp-Lipton theorem ( which proves that, if SAT can be solved by Boolean circuits with a polynomial number of logic gates, then the polynomial hierarchy collapses to its second level ).
15. If, for every " n ", there is a polynomial size Boolean circuit " A " ( " n " ) deciding the problem, we can use a Turing machine that interprets the advice string as a description of the circuit.
16. O . B . Lupanov is best known for his ( " k ", " s " )-Lupanov representation of Boolean functions that he used to devise an asymptotically optimal method of Boolean circuit synthesis, thus proving the asymptotically tight upper bound on Boolean circuit complexity:
更多例句：  上一页    下一页