Add to ORKGTropical circuits are circuits with Min and Plus, or Max and Plus operations as gates. Their importance stems from their intimate relation to dynamic programming algorithms. The power of tropical circuits lies somewhere between that of monotone boolean circuits and monotone arith-metic circuits. In this paper we present some lower bounds arguments for tropical circuits, and hence, for dynamic programs
We show that uniform families of ACC circuits of subexponential size cannot compute the permanent fu...
This paper describes the development of finite abstractions of Max-Plus-Linear (MPL) systems using t...
In this paper, we investigate the lower bound on the number of gates in a Boolean circuit that comp...
We prove lower bounds on pure dynamic programming algorithms for maximum weight independent set (MWI...
We prove lower bounds on pure dynamic programming algorithms for maximum weight independent set (MWI...
We consider the problem of proving circuit lower bounds against the polynomialtime hierarchy. We giv...
We consider the problem of proving circuit lower bounds against the polynomial-time hierarchy. We gi...
We consider the problem of proving circuit lower bounds against the polynomialtime hierarchy. We giv...
Computational complexity theory and algorithms are two major areas in theoretical computer science. ...
The lower bounds problem in circuit complexity theory may be looked as the problem about the possibi...
This dissertation presents some circuit complexity results and techniques. Circuit complexity is a b...
Boolean circuits were introduced in complexity theory to provide a model for parallel computation. A...
In 2010, the author proposed a program for proving lower bounds in circuit complexity, via faster al...
Our main result is a combinatorial lower bounds criterion for a general model of monotone circuits, ...
Tropical polyhedra have been recently used to represent disjunctive invariants in static analysis. T...
We show that uniform families of ACC circuits of subexponential size cannot compute the permanent fu...
This paper describes the development of finite abstractions of Max-Plus-Linear (MPL) systems using t...
In this paper, we investigate the lower bound on the number of gates in a Boolean circuit that comp...
We prove lower bounds on pure dynamic programming algorithms for maximum weight independent set (MWI...
We prove lower bounds on pure dynamic programming algorithms for maximum weight independent set (MWI...
We consider the problem of proving circuit lower bounds against the polynomialtime hierarchy. We giv...
We consider the problem of proving circuit lower bounds against the polynomial-time hierarchy. We gi...
We consider the problem of proving circuit lower bounds against the polynomialtime hierarchy. We giv...
Computational complexity theory and algorithms are two major areas in theoretical computer science. ...
The lower bounds problem in circuit complexity theory may be looked as the problem about the possibi...
This dissertation presents some circuit complexity results and techniques. Circuit complexity is a b...
Boolean circuits were introduced in complexity theory to provide a model for parallel computation. A...
In 2010, the author proposed a program for proving lower bounds in circuit complexity, via faster al...
Our main result is a combinatorial lower bounds criterion for a general model of monotone circuits, ...
Tropical polyhedra have been recently used to represent disjunctive invariants in static analysis. T...
We show that uniform families of ACC circuits of subexponential size cannot compute the permanent fu...
This paper describes the development of finite abstractions of Max-Plus-Linear (MPL) systems using t...
In this paper, we investigate the lower bound on the number of gates in a Boolean circuit that comp...