Concept

Circuit complexity

Related publications (189)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Faster Integer Multiplication

For more than 35 years, the fastest known method for integer multiplication has been the Schonhage-Strassen algorithm running in time O(n log n log log n). Under certain restrictive conditions, there is a corresponding Omega(n log n) lower bound. All this ...

2009

Constructing Convex Planes In The Pants Complex

Hugo Parlier

Our main theorem identifies a class of totally geodesic subgraphs of the 1-skeleton of the pants complex, referred to as the pants graph, each isomorphic to the product of two Farey graphs. We deduce the existence of many convex planes in the pants graph o ...

2009

Computational Performance of a Parallelized Three-Dimensional High-Order Spectral Element Toolbox

Michel Deville, Nicolas Fietier, Vincent Keller, Roland Bouffanais, Jonas Marcel Lätt, Christoph Bosshard, Sohrab Jairo Kehtari, Christian Clémençon

In this paper, a comprehensive performance review of all MPI-based high-order three-dimensional spectral element method C++ toolbox is presented. The focus is put on the performance evaluation of aspects with a particular emphasis on the parallel efficienc ...

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2009

Low-Density Codes Based on Chaotic Systems for Low-Density Codes Based on Chaotic Systems for Simple Encoding

Martin Hasler, Slobodan Kozic

This paper proposes a new class of low-density generator-matrix codes (LDGM) based on chaotic dynamical systems. The codes are designed by controlling symbolic dynamics and using linear convolutional codes. Analyzing the complex structure of chaotic system ...

2009

Challenges in Automatic Optimization of Arithmetic Circuits

Paolo Ienne, Philip Brisk, Ajay Kumar Verma

Despite the impressive progress of logic synthesis in the past decade, finding the best architecture for a given circuit still remains an open and largely unsolved problem, especially for arithmetic circuits. In many cases, the outcome of even the most adv ...

Ieee Computer Soc Press, Customer Service Center, Po Box 3014, 10662 Los Vaqueros Circle, Los Alamitos, Ca 90720-1264 Usa2009

A scalable and oblivious atomicity assertion

Rachid Guerraoui, Marko Vukolic

This paper presents SOAR: the first oblivious atomicity assertion with polynomial complexity. SOAR enables to check atomicity of a single-writer multi-reader register implementation. The basic idea underlying the low overhead induced by SOAR lies in greedi ...

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2008

Variable latency speculative addition: A new paradigm for arithmetic circuit design

Paolo Ienne, Philip Brisk, Ajay Kumar Verma

Adders are one of the key components in arithmetic circuits. Enhancing their performance can significantly improve the quality of arithmetic designs. This is the reason why the theoretical lower bounds on the delay and area of an adder have been analysed, ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2008

The Collective Memory of Amnesic Processes

Rachid Guerraoui, Bastian Pochon, James Pugh, Ron Levy

This paper considers the problem of robustly emulating a shared atomic memory over a distributed message passing system where processes can fail by crashing and possibly recover. We revisit the notion of atomicity in the crash-recovery context and introduc ...

2008

The Complexity of Distinguishing Distributions

Serge Vaudenay, Thomas Baignères

Cryptography often meets the problem of distinguishing distributions. In this paper we review techniques from hypothesis testing to express the advantage of the best distinguisher limited to a given number of samples. We link it with the Chernoff informati ...

Springer2008

Diffusion LMS algorithms with information exchange

Ali H. Sayed

We consider the problem of distributed estimation, where a set of nodes are required to collectively estimate some parameter of interest. We motivate and propose new versions of the diffusion LMS algorithm, including a version that outperforms previous sol ...

IEEE2008