Small Hazard-free Transducers

11/29/2018
by   Johannes Bund, et al.
0

Recently, an unconditional exponential separation between the hazard-free complexity and (standard) circuit complexity of explicit functions has been shown. This raises the question: which classes of functions permit efficient hazard-free circuits? Our main result is as follows. A transducer is a finite state machine that transcribes, symbol by symbol, an input string of length n into an output string of length n. We prove that any function arising from a transducer with s states, that is input symbols which are encoded by ℓ bits, has a hazard-free circuit of size 2^(s+ℓ)· n and depth (ℓ+ s· n); in particular, if s, ℓ∈(1), size and depth are asymptotically optimal. We utilize our main result to derive efficient circuits for k-recoverable addition. Informally speaking, a code is k-recoverable if it does not increase uncertainty regarding the encoded value, so long as it is guaranteed that it is from {x,x+1,...,x+k} for some x∈_0. We provide an asymptotically optimal k-recoverable code. We also realize a transducer with (k) states that adds two codewords from this k-recoverable code. Combined with our main result, we obtain a hazard-free adder circuit of size 2^(k)n and depth (k n) with respect to this code, i.e., a k-recoverable adder circuit that adds two codewords of n bits each. In other words, k-recoverable addition is fixed-parameter tractable with respect to k.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

09/02/2020

Circuit Satisfiability Problem for circuits of small complexity

The following problem is considered. A Turing machine M, that accepts a ...
04/24/2020

Small circuits and dual weak PHP in the universal theory of p-time algorithms

We prove, under a computational complexity hypothesis, that it is consis...
09/22/2017

Quantified Derandomization of Linear Threshold Circuits

One of the prominent current challenges in complexity theory is the atte...
06/23/2019

Approximating Unitary Preparations of Orthogonal Black Box States

In this paper, I take a step toward answering the following question: fo...
02/21/2018

Non-Malleable Codes for Small-Depth Circuits

We construct efficient, unconditional non-malleable codes that are secur...
11/01/2019

Optimal Metastability-Containing Sorting via Parallel Prefix Computation

Friedrichs et al. (TC 2018) showed that metastability can be contained w...
07/25/2021

Low-bandwidth recovery of linear functions of Reed-Solomon-encoded data

We study the problem of efficiently computing on encoded data. More spec...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.