标签circuits - 这是页18 - GeneraCodice

Computing a boolean function with a small formula

https://www.generacodice.com/cn/articolo/1546700/computing-a-boolean-function-with-a-small-formula
  circuits  -  boolean-algebra
cs.stackexchange cs.stackexchange

How to read $NC^1\subset L \subset NL \subset SAC^1$, $SAC^1=LOGCFL/poly$, and similar statements?

https://www.generacodice.com/cn/articolo/1545392/how-to-read-nc-1-subset-l-subset-nl-subset-sac-1-sac-1-logcfl-poly-and-similar-statements
  complexity-theory  -  circuits
cs.stackexchange cs.stackexchange

What is the decidable language in $P/poly$ but not in $P$?

https://www.generacodice.com/cn/articolo/1544714/what-is-the-decidable-language-in-p-poly-but-not-in-p
  complexity-theory  -  circuits  -  polynomial-time
cs.stackexchange cs.stackexchange

Is there an intuitive proof for the existence of hard functions?

https://www.generacodice.com/cn/articolo/1544325/is-there-an-intuitive-proof-for-the-existence-of-hard-functions
  complexity-theory  -  circuits  -  lower-bounds  -  boolean-algebra
cs.stackexchange cs.stackexchange

Creating bigger controlled nots from single qubit, Toffoli, and CNOT gates, without workspace

https://www.generacodice.com/cn/articolo/1543529/creating-bigger-controlled-nots-from-single-qubit-toffoli-and-cnot-gates-without-workspace
  quantum-computing  -  circuits
cs.stackexchange cs.stackexchange

Is it possible to make N-way Controlled-NOTs out of Toffoli gates, without extra work bits?

https://www.generacodice.com/cn/articolo/1543458/is-it-possible-to-make-n-way-controlled-nots-out-of-toffoli-gates-without-extra-work-bits
  circuits  -  reversible-computing
cs.stackexchange cs.stackexchange

Sum of $\log n$ $n$-bit integers is in $\mathsf{AC^0}$

https://www.generacodice.com/cn/articolo/1538738/sum-of-log-n-n-bit-integers-is-in-mathsf-ac-0
  complexity-theory  -  circuits
cs.stackexchange cs.stackexchange

Combinational Logic Circuits and Theory of Computation

https://www.generacodice.com/cn/articolo/1535138/combinational-logic-circuits-and-theory-of-computation
  complexity-theory  -  turing-machines  -  computation-models  -  circuits
cs.stackexchange cs.stackexchange

2-SAT or 3-SAT or k-SAT in AC-0

https://www.generacodice.com/cn/articolo/1534726/2-sat-or-3-sat-or-k-sat-in-ac-0
  circuits
cs.stackexchange cs.stackexchange

What is the relation between arithmetic circuits and straight line programs?

https://www.generacodice.com/cn/articolo/1533874/what-is-the-relation-between-arithmetic-circuits-and-straight-line-programs
  complexity-theory  -  circuits
cs.stackexchange cs.stackexchange
发现结果: 222
scroll top