Publications associées à Circuit complexity

Efficient Statistical Parameter Selection for Nonlinear Modeling of Process/Performance Variation

Giovanni De Micheli, Pierre-Emmanuel Julien Marc Gaillardon, Hassan Ghasemzadeh Mohammadi

With the growing number of process variation sources in deeply nano-scaled technologies, parameterized device and circuit modeling is becoming very important for chip design and verification. However, the high dimensionality of parameter space, for process ...

Ieee-Inst Electrical Electronics Engineers Inc2016

Incremental View Maintenance for Collection Programming

Christoph Koch, Daniel Lupei, Val Tannen

In the context of incremental view maintenance (IVM), delta query derivation is an essential technique for speeding up the processing of large, dynamic datasets. The goal is to generate delta queries that, given a small change in the input, can update the ...

ACM2016

A Composition Theorem for Conical Juntas

Mika Tapani Göös

We describe a general method of proving degree lower bounds for conical juntas (nonnegative combinations of conjunctions) that compute recursively defined boolean functions. Such lower bounds are known to carry over to communication complexity. We give two ...

Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany2016

Enumeration of reversible functions and its application to circuit complexity

Giovanni De Micheli, Mathias Soeken, Nabila Abdessaied

We review combinational results to enumerate and classify reversible functions and investigate the application to circuit complexity. In particularly, we consider the effect of negating and permuting input and output variables and the effect of applying li ...

Springer2016

The Programmable Logic-in-Memory (PLiM) Computer (Invited)

Giovanni De Micheli, Pierre-Emmanuel Julien Marc Gaillardon, Luca Gaetano Amarù, Anupam Chattopadhyay

Realization of logic and storage operations in memristive circuits have opened up a promising research direction of in-memory computing. Elementary digital circuits, e.g., Boolean arithmetic circuits, can be economically realized within memristive circuits ...

Ieee2016

On the Difficulty of Selecting Ising Models with Approximate Recovery

Volkan Cevher, Jonathan Mark Scarlett

In this paper, we consider the problem of estimating the underlying graph associated with an Ising model given a number of independent and identically distributed samples. We adopt an approximate recovery criterion that allows for a number of missed edges ...

Ieee-Inst Electrical Electronics Engineers Inc2016

Complexity Constrained Representation Selection for Dynamic Adaptive Streaming

Pascal Frossard, Laura Toni, Chenglin Li

In this paper, we propose a representation selection optimization problem for complexity constrained adaptive video streaming that properly takes into account the different complexity-rate-distortion (C-R-D) characteristics of the videos when implementing ...

Ieee2016

On Selection of Samples in Algebraic Attacks and a New Technique to Find Hidden Low Degree Equations

Serge Vaudenay, Pouyan Sepehrdad, Petr Susil

The best way of selecting samples in algebraic attacks against block ciphers is not well explored and understood. We introduce a simple strategy for selecting the plaintexts and demonstrate its strength by breaking reduced-round KATAN, LBLOCK and SIMON. Fo ...

Springer Verlag2016

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Circuit complexity

EU COST Action IC1401-Pushing the Frontiers of Memristive Devices to Systems

Efficient Statistical Parameter Selection for Nonlinear Modeling of Process/Performance Variation

Incremental View Maintenance for Collection Programming

A Composition Theorem for Conical Juntas

Enumeration of reversible functions and its application to circuit complexity

The Programmable Logic-in-Memory (PLiM) Computer (Invited)

A Dichotomy for Real Weighted Holant Problems

On the Difficulty of Selecting Ising Models with Approximate Recovery

Complexity Constrained Representation Selection for Dynamic Adaptive Streaming

On Selection of Samples in Algebraic Attacks and a New Technique to Find Hidden Low Degree Equations

Graph Chatbot

Chattez avec Graph Search

EU COST Action IC1401-Pushing the Frontiers of Memristive Devices to Systems

The Programmable Logic-in-Memory (PLiM) Computer (Invited)

Enumeration of reversible functions and its application to circuit complexity

A Dichotomy for Real Weighted Holant Problems

Complexity Constrained Representation Selection for Dynamic Adaptive Streaming

Efficient Statistical Parameter Selection for Nonlinear Modeling of Process/Performance Variation

A Composition Theorem for Conical Juntas

Incremental View Maintenance for Collection Programming

On the Difficulty of Selecting Ising Models with Approximate Recovery

On Selection of Samples in Algebraic Attacks and a New Technique to Find Hidden Low Degree Equations