<%@ page language="java" contentType="text/html" %> <%-- Include common initialisation code --%> <%@ include file="/arch/common.jsp" %> <%-- The current tab --%> <% String currentTab = "Research"; %> <%-- Content of navigation pane --%> <%@ include file="nav.jsp" %> <% showCurrentLink=true; %> <%-- Current navigation location --%> <% String currentNav = "Reports and Theses"; %> <%-- Include the code for the document header --%> <%@ include file="/arch/header.jsp" %>

Research Report CS-RR-155

<%-- Include the code for the lines and navigation --%> <%@ include file="/arch/middle.jsp" %>

M.S. Paterson and U. Zwick, Improved Circuits and Formulae for Multiple Addition, Multiplication and Symmetric Boolean Functions (March 1, 1990).

Abstract

Circuits and formulae over several bases, with improved depth and size respectively, are given for the carry save addition of n binary numbers (i.e., obtaining two numbers whose sum is equal to the sum of the n numbers). As a consequence improved circuits and formulae for multiple addition, multiplication and for most symmetric Boolean functions are obtained.

<%@ include file="cited.html" %>

M.S. Paterson, N. Pippenger and U. Zwick, "Improved Circuits and Formulae for Multiple Addition, Multiplication and Symmetric Boolean Functions", Boolean Function Complexity, LMS Lecture Note Series 169, Cambridge University Press, Cambridge, UK, pp. 174-201 (1992)

<%-- Include the code for the document footer --%> <%@ include file="/arch/footer.jsp" %>