Faster Integer Multiplication

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.

This contribution focuses on the fabrication and characterization of microchannel plates made of hydrogenated amorphous silicon (AMCPs). Flexible fabrication processes and the semi-conducting nature of amorphous silicon could give these detectors the advan ...

Many natural optimization problems are NP-hard, which implies that they are probably hard to solve exactly in the worst-case. However, it suffices to get reasonably good solutions for all (or even most) instances in practice. This paper presents a new algo ...

We consider the problem of solving integer programs of the form min {c^⊺ x : Ax = b, x ∈ ℤ_{⩾ 0}}, where A is a multistage stochastic matrix in the following sense: the primal treedepth of A is bounded by a parameter d, which means that the columns of A ca ...

Weighted flow time is a fundamental and very well-studied objective function in scheduling. In this paper, we study the setting of a single machine with preemptions. ...

One of the most basic graph problems, All-Pairs Shortest Paths (APSP) is known to be solvable in n^{3-o(1)} time, and it is widely open whether it has an O(n^{3-ε}) time algorithm for ε > 0. To better understand APSP, one often strives to obtain subcubic t ...

We propose a flow for automated quantum compila- tion. Our flow takes a Boolean function implemented in Python as input and translates it into a format appropriate for reversible logic synthesis. We focus on two quantum compilation tasks: uniform state pre ...

Threshold Implementations have become a popular generic technique to construct circuits resilient against power analysis attacks.In this paper, we look to devise efficient threshold circuits for the lightweight block cipher family SKINNY. The only threshol ...

Cut and spectral sparsification of graphs have numerous applications, including e.g. speeding up algorithms for cuts and Laplacian solvers. These powerful notions have recently been extended to hypergraphs, which are much richer and may offer new applicati ...

An integer program (IP) is a problem of the form

\min \{f(x) : \, Ax = b, \ l \leq x \leq u, \ x \in \Z^n\}

, where

A \in \Z^{m \times n}

b \in \Z^m

l,u \in \Z^n

, and

f: \Z^n \rightarrow \Z

is a separable convex objective function. The problem o ...

We consider integer programming problems in standard form max{c(T)x : Ax = b, x >= 0, x is an element of Z(n)} where A is an element of Z(mxn), b is an element of Z(m), and c is an element of Z(n). We show that such an integer program can be solved in time ...

This work targets fault-tolerant quantum computing and focuses on the problem of mapping reversible circuits into the Clifford+T quantum gate library. We present an automatically-generated database containing minimal-cost quantum circuits for Boolean funct ...

Logic synthesis is a fundamental step in the realization of modern integrated circuits. It has traditionally been employed for the optimization of CMOS-based designs, as well as for emerging technologies and quantum computing. Recently, it found applicatio ...

Faster Integer Multiplication

Chat with Graph Search

Fabrication and Characterization of High Aspect Ratio Amorphous Silicon Based Microchannel Plates

Learning from survey propagation: a neural network for MAX-E-3-SAT

Efficient Sequential and Parallel Algorithms for Multistage Stochastic Integer Programming Using Proximity

A (2+epsilon)-Approximation Algorithm for Preemptive Weighted Flow Time on a Single Machine

Faster Monotone Min-Plus Product, Range Mode, and Single Source Replacement Paths

From Boolean functions to quantum circuits: A scalable quantum compilation flow in C++

Improving First-Order Threshold Implementations of SKINNY

Towards Tight Bounds for Spectral Sparsification of Hypergraphs

New Results in Integer and Lattice Programming

Proximity Results and Faster Algorithms for Integer Programming Using the Steinitz Lemma

Enumerating Optimal Quantum Circuits using Spectral Classification

A Logic Synthesis Toolbox for Reducing the Multiplicative Complexity in Logic Networks