983 search results - page 3 / 197 » Circuit Complexity and Multiplicative Complexity of Boolean ... |
CSREAESA
2004
13 years 7 months ago
2004
- The model of a simple perceptron using phase-encoded inputs and complex-valued weights is presented. Multilayer two-input and three-input complex-valued neurons (CVNs) are implem...
JACM
2002
13 years 5 months ago
2002
An exponential lower bound on the circuit complexity of deciding the weak monadic second-order theory of one successor (WS1S) is proved. Circuits are built from binary operations, ...
ECCC
2010
13 years 5 months ago
2010
An errorless circuit for a boolean function is one that outputs the correct answer or "don't know" on each input (and never outputs the wrong answer). The goal of e...
CDES
2008
13 years 7 months ago
2008
This paper presents a quantum algorithm for finding minimal ESCT (Exclusive-or Sum of Complex Terms) or ESOP (Exclusive-or Sum Of Products) expressions for any arbitrary multi-outp...
STOC
2009
ACM
14 years 6 months ago
2009
ACM
We consider the following question: given a two-argument boolean function f, represented as an N ? N binary matrix, how hard is to determine the (deterministic) communication comp...