en
italiano
english
français
española
中国
日本の
العربية
Deutsch
한국어
Português
Russian
Full articles
Categories
C#
PHP
PYTHON
JAVA
SQL SERVER
MYSQL
HTML
CSS
JQUERY
VUE
ReactJS
You write
User
Login
Registration
Password recovery
Tags
Language tags
Back-end
C#
PHP
JAVA
PYTHON
Database
Sql server
Mysql
Front-end
HTML
CSS
JQUERY
ANGULARJS
REACT
VUE.JS
Tag circuits - This is page 17 - GeneraCodice
Why is c) a combinational circuit, but d) not?
https://www.generacodice.com/en/articolo/1562318/why-is-c-a-combinational-circuit-but-d-not
logic
-
computer-architecture
-
circuits
-
digital-circuits
cs.stackexchange
*non-uniform* $ACC^0$ and above classes
https://www.generacodice.com/en/articolo/1562084/non-uniform-acc-0-and-above-classes
complexity-theory
-
circuits
cs.stackexchange
Difference between $\mathsf{SIZE}(n^k)$ vs $\mathsf{P/poly}$ and $\mathsf{SIZE}(n)$ vs linear size circuit?
https://www.generacodice.com/en/articolo/1561976/difference-between-mathsf-size-n-k-vs-mathsf-p-poly-and-mathsf-size-n-vs-linear-size-circuit
complexity-theory
-
circuits
cs.stackexchange
Algorithms for logical synthesis
https://www.generacodice.com/en/articolo/1561799/algorithms-for-logical-synthesis
logic
-
algorithms
-
circuits
cs.stackexchange
Classical Computation without NOT
https://www.generacodice.com/en/articolo/1547915/classical-computation-without-not
computation-models
-
circuits
-
digital-circuits
-
boolean-algebra
cs.stackexchange
Computing a boolean function with a small formula
https://www.generacodice.com/en/articolo/1546700/computing-a-boolean-function-with-a-small-formula
circuits
-
boolean-algebra
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/en/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
What is the decidable language in $P/poly$ but not in $P$?
https://www.generacodice.com/en/articolo/1544714/what-is-the-decidable-language-in-p-poly-but-not-in-p
complexity-theory
-
circuits
-
polynomial-time
cs.stackexchange
Is there an intuitive proof for the existence of hard functions?
https://www.generacodice.com/en/articolo/1544325/is-there-an-intuitive-proof-for-the-existence-of-hard-functions
complexity-theory
-
circuits
-
lower-bounds
-
boolean-algebra
cs.stackexchange
Creating bigger controlled nots from single qubit, Toffoli, and CNOT gates, without workspace
https://www.generacodice.com/en/articolo/1543529/creating-bigger-controlled-nots-from-single-qubit-toffoli-and-cnot-gates-without-workspace
quantum-computing
-
circuits
cs.stackexchange
«
14
15
16
17
18
19
»
Results found: 222