This paper provides an investigation of power distribution network (PDN) performance by a full-wave prediction tool and by experimental measurements. A set of six real boards characterized by increasing complexity is considered in order to establish a solid base for behaviour understanding of printed circuit boards. How the growing complexity impacts on the board performance is investigated by ...

Imposing an extensional uniformity condition on a non-uniform circuit complexity class C means simply intersecting C with a uniform class L. By contrast, the usual intensional uniformity conditions require that a resource-bounded machine be able to exhibit the circuits in the circuit family defining C. We say that (C,L) has the Uniformity Duality Property if the extensionally uniform class C∩L ...

In this note, we present improved upper bounds on the circuit complexity of symmetric Boolean functions. In particular, we describe circuits of size 4.5n + o(n) for any symmetric function of n variables, as well as circuits of size 3n for MOD3 function.

In this paper, a low-complexity current-mode Winner-Take-All circuit (WTA) of O(n) complexity with logical outputs is presented. The proposed approach employs a Quasi-FG Inverter as the key element for current integration and the computing of the winning cell. The design was implemented in a double-poly, three metal layers, 0.5m CMOS technology. The circuit exhibits a good accuracy-speed trade...

We give a new quantum circuit approximation for quantum multiplexors based on the idea of complexity theory oracles. As an added bonus, our multiplexor approximation immediately gives a quantum circuit approximation of diagonal unitary matrices.

We survey circuit complexity theory, satisfiability algorithms for circuits, and the recent framework of Ryan Williams’s for obtaining circuit lower bounds from these nontrivial satisfiability algorithms. We give some slightly improved arithmetization constructions based on -biased sets which reduce the sample space of the resulting probabilistic polynomials. We also examine an application of c...

I will describe prior and current work on connecting the art of finding good satisfiability algorithms with the art of proving complexity lower bounds: proofs of limitations on what problems can be solved by good algorithms. Surprisingly, even minor algorithmic progress on solving the circuit satisfiability problem faster than exhaustive search can be applied to prove strong circuit complexity ...