Results 271 to 280 of about 93,203 (297)
Some of the next articles are maybe not open access.
1977
Several types of reductions between finite Boolean functions are introduced and compared. The corresponding degrees are investigated with the purpose to classify Boolean functions.
openaire +1 more source
Several types of reductions between finite Boolean functions are introduced and compared. The corresponding degrees are investigated with the purpose to classify Boolean functions.
openaire +1 more source
1992
The talk will survey some old, and some recent, results relating to Boolean circuits, and will concentrate particularly on the lower levels of complexity.
openaire +1 more source
The talk will survey some old, and some recent, results relating to Boolean circuits, and will concentrate particularly on the lower levels of complexity.
openaire +1 more source
2013
We show that Shuffle(x,y,w), the problem of determining whether a string w can be composed from an order preserving shuffle of strings x and y, is not in AC 0, but it is in AC 1. The fact that shuffle is not in AC 0 is shown by a reduction of parity to shuffle and invoking the seminal result [FSS84, while the fact that it is in AC 1 is implicit in the ...
openaire +1 more source
We show that Shuffle(x,y,w), the problem of determining whether a string w can be composed from an order preserving shuffle of strings x and y, is not in AC 0, but it is in AC 1. The fact that shuffle is not in AC 0 is shown by a reduction of parity to shuffle and invoking the seminal result [FSS84, while the fact that it is in AC 1 is implicit in the ...
openaire +1 more source
The Complexity of Tensor Circuit Evaluation
computational complexity, 2001The study of tensor calculus over semirings in terms of complexity theory was initiated by Damm et al. in [8]. Here we first look at tensor circuits, a natural generalization of tensor formulas; we show that the problem of asking whether the output of such circuits is non-zero is complete for the class NE = NTIME(2O(n)) for circuits over the boolean ...
Martin Beaudry, Markus Holzer 0001
openaire +1 more source
Journal of the ACM, 1989
Much complexity-theoretic work on parallelism has focused on the class NC, which is defined in terms of logspace-uniform circuits. Yet P-uniform circuit complexity is in some ways a more natural setting for studying feasible parallelism. In this paper, P-uniform NC (PUNC) is characterized in terms of space-bounded AuxPDAs and alternating ...
openaire +1 more source
Much complexity-theoretic work on parallelism has focused on the class NC, which is defined in terms of logspace-uniform circuits. Yet P-uniform circuit complexity is in some ways a more natural setting for studying feasible parallelism. In this paper, P-uniform NC (PUNC) is characterized in terms of space-bounded AuxPDAs and alternating ...
openaire +1 more source
The polynomial method in circuit complexity
[1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference, 2002The basic techniques for using polynomials in complexity theory are examined, emphasizing intuition at the expense of formality. The focus is on the connections to constant-depth circuits, at the expense of polynomial-time Turing machines. The closure properties, upper bounds, and lower bounds obtained by this approach are surveyed. >
openaire +1 more source
On the complexity of planar Boolean circuits
Computational Complexity, 1995zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
On the complexity of encoding in analog circuits
Information Processing Letters, 1996zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Borel sets and circuit complexity
Proceedings of the fifteenth annual ACM symposium on Theory of computing - STOC '83, 1983It is shown that for every k, polynomial-size, depth-k Boolean circuits are more powerful than polynomial-size, depth-(k−1) Boolean circuits. Connections with a problem about Borel sets and other questions are discussed.
openaire +1 more source
Complexity in Electronic Switching Circuits
IRE Transactions on Electronic Computers, 1956The complexity of an electronic switching circuit is defined in a sufficiently general way so that most definitions which are presently used may be included. If ?(p, q) is the complexity of a p input q output circuit which has been minimized then we may define E(p, q) as the maximum of ?(p, q) over all p input, q output circuits.
openaire +1 more source