On the complexity of slice functionsWEGENER, I.Theoretical computer science. 1985, Vol 38, Num 1, pp 55-68, issn 0304-3975Article

Bounded-width polynomial-size Boolean formulas compute exactly those functions in AC⁰ISTRAIL, S; ZIVKOVIC, D.Information processing letters. 1994, Vol 50, Num 4, pp 211-216, issn 0020-0190Article

Negation-Limited Inverters of Linear Size : Foundations of Computer ScienceMORIZUMI, Hiroki; SUZUKI, Genki.IEICE transactions on information and systems. 2010, Vol 93, Num 2, pp 257-262, issn 0916-8532, 6 p.Article

More on the complexity of slice functionsWEGENER, I.Theoretical computer science. 1986, Vol 43, Num 2-3, pp 201-211, issn 0304-3975Article

The graph of multiplication is equivalent to countingBUSS, S. R.Information processing letters. 1992, Vol 41, Num 4, pp 199-201, issn 0020-0190Article

A note on dimensions of polynomial size circuitsXIAOYANG GU.Theoretical computer science. 2006, Vol 359, Num 1-3, pp 176-187, issn 0304-3975, 12 p.Article

AREA-TIME BOUNDS FOR VLSI CIRCUITSWADA K; HAGIHARA K; TOKURA N et al.sdANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL AND COMPUTING. 19/1981/MONTICELLO IL; USA; DA. S.D.; PP. 234Conference Paper

On the negation-limited circuit complexity of mergingAMANO, Kazuyuki; MARUOKA, Akira; TARUI, Jun et al.Discrete applied mathematics. 2003, Vol 126, Num 1, pp 3-8, issn 0166-218X, 6 p.Conference Paper

Bounds on an exponential sum arising in Boolean circuit complexityGREEN, Frederic; ROY, Amitabha; STRAUBING, Howard et al.Comptes rendus. Mathématique. 2005, Vol 341, Num 5, pp 279-282, issn 1631-073X, 4 p.Article

A low-power decimation filter for a sigma-delta converter based on a power-optmized sinc filterGEROSA, Andrea; NEVIANI, Andrea.IEEE International Symposium on Circuits and Systems. 2004, pp 245-248, isbn 0-7803-8251-X, 4 p.Conference Paper

High performance viterbi decoder using modified register exchange methodsHAN, Jae-Sun; KIM, Tae-Jin; LEE, Chanho et al.IEEE International Symposium on Circuits and Systems. 2004, pp 553-556, isbn 0-7803-8251-X, 4 p.Conference Paper

Functional complexity estimation for large combinational circuitsABORHEY, S.IEE proceedings. Computers and digital techniques. 2002, Vol 149, Num 2, pp 39-45, issn 1350-2387Article

Combinational ae-af system with fuzzy climbing search servoCHEN, Chao-Yeh; TSENG, Chen-Yu; HUNG, Chi-Hsuan et al.Proceedings of SPIE, the International Society for Optical Engineering. 2006, pp 60690B.1-60690B.8, issn 0277-786X, isbn 0-8194-6109-1, 1VolConference Paper

An optimal parallel algorithm for formula evaluationBUSS, S; COOK, S; GUPTA, A et al.SIAM journal on computing (Print). 1992, Vol 21, Num 4, pp 755-780, issn 0097-5397Article

SOME OBSERVATIONS ON NP REAL NUMBERS AND P-SELECTIVE SETSSELMAN AL.1981; J. COMPUT. SYST. SCI.; ISSN 0022-0000; USA; DA. 1981; VOL. 23; NO 3; PP. 326-332; BIBL. 11 REF.Article

I/O LIMITATIONS ON MULTI-CHIP VLSI SYSTEMSSNIR M.sdANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL AND COMPUTING. 19/1981/MONTICELLO IL; USA; DA. S.D.; PP. 224-233; BIBL. 5 REF.Conference Paper

NEW LOWER BOUND TECHNIQUES FOR VLSILEIGHTON FT.1981; ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE. 22/1981/NASHVILLE TN; USA; NEW YORK: INSTITUTE OF ELECTRICAL & ELECTRONICS ENGINEERS; DA. 1981; PP. 1-12; BIBL. 18 REF.Conference Paper

Energy reduction of the fetch mechanism through dynamic adaptationDEL PINO, S; CHAVER, D; PINUEL, L et al.IET computers & digital techniques (Print). 2008, Vol 2, Num 2, pp 94-107, issn 1751-8601, 14 p.Article

Hardware-efficient FIR filters with reduced adder stepMASKELL, D. L; LIEWO, J.Electronics Letters. 2005, Vol 41, Num 22, pp 1211-1213, issn 0013-5194, 3 p.Article

Complexity-theoretical approaches to the design and analysis of cryptographical boolean functionsGONZALEZ COBAS, Juan David; LOPEZ BRUGOS, José Antonio.Lecture notes in computer science. 2005, pp 337-345, issn 0302-9743, isbn 3-540-29002-8, 1Vol, 9 p.Conference Paper

Mixed polarity reversible Peres gatesMORAGA, C.Electronics letters. 2014, Vol 50, Num 14, pp 987-989, issn 0013-5194, 3 p.Article

A Novel Methodology to Reduce Leakage Power in CMOS Complementary CircuitsLAKSHMIKANTHAN, Preetham; NUNEZ, Adrian.Lecture notes in computer science. 2006, pp 614-623, issn 0302-9743, isbn 3-540-39094-4, 1Vol, 10 p.Conference Paper

Memory optimization techniques for UMTS code generationIACONO, Daniele Lo; MESSINA, Ettore; AVELLONE, Giuseppe et al.IEEE International Symposium on Circuits and Systems. 2004, pp 73-76, isbn 0-7803-8251-X, 4 p.Conference Paper

A switching lemma for small restrictions and lower bounds for κ-DNF resolution: (Extended abstract)SEGERLIND, Nathan; BUSS, Sam; IMPAGLIAZZO, Russell et al.Annual Symposium on Foundations of Computer Science. 2002, pp 604-613, isbn 0-7695-1822-2, 10 p.Conference Paper

Complexity of Boolean functions over bases with unbounded fan-in gatesDANCIK, V.Information processing letters. 1996, Vol 57, Num 1, pp 31-34, issn 0020-0190Article