Say that f:{0,1}n →{0,1} ε-approximates g : {0,1} n →{0,1} if the functions disagree on at most an ε fraction of points. This paper contains two results about approximation by DNF and other small-depth circuit
The usual OBDD-data structure can easily be equipped with nondeterminism by allowing several edges w...
National audienceWe study the expressivity of sparsely connected deep networks. Measuring a network'...
This paper gives the first separation between the power of formulas and circuits of equal depth in ...
We study how big the blow-up in size can be when one switches between the CNF and DNF representation...
We describe a deterministic algorithm that, for constant k, given a k-DNF or k-CNF formula ϕ and a p...
AbstractWe study how big the blow-up in size can be when one switches between the CNF and DNF repres...
The relativized weak pigeonhole principle states that if at least 2n out of n2 pigeons fly into n ho...
Abstract. A general recipe for high order approximation of generalized func-tions is introduced whic...
For circuit classes R, the fundamental computational problem Min-R asks for the minimum R-size of a ...
We describe a deterministic algorithm that, for constant k, given a k-DNF or k-CNF formula phi and a...
In a previous paper "Frames and numerical approximation" we described the numerical properties of fu...
Abstract The relativized weak pigeonhole principle states that if at least 2n out of n 2 pigeons fly...
We prove a new switching lemma that works for restrictions that set only a small fraction of the var...
Recently there has been much interest in understanding why deep neural networks are preferred to sha...
Approximation theory studies the process of approaching arbitrary functions by simple func-tions dep...
The usual OBDD-data structure can easily be equipped with nondeterminism by allowing several edges w...
National audienceWe study the expressivity of sparsely connected deep networks. Measuring a network'...
This paper gives the first separation between the power of formulas and circuits of equal depth in ...
We study how big the blow-up in size can be when one switches between the CNF and DNF representation...
We describe a deterministic algorithm that, for constant k, given a k-DNF or k-CNF formula ϕ and a p...
AbstractWe study how big the blow-up in size can be when one switches between the CNF and DNF repres...
The relativized weak pigeonhole principle states that if at least 2n out of n2 pigeons fly into n ho...
Abstract. A general recipe for high order approximation of generalized func-tions is introduced whic...
For circuit classes R, the fundamental computational problem Min-R asks for the minimum R-size of a ...
We describe a deterministic algorithm that, for constant k, given a k-DNF or k-CNF formula phi and a...
In a previous paper "Frames and numerical approximation" we described the numerical properties of fu...
Abstract The relativized weak pigeonhole principle states that if at least 2n out of n 2 pigeons fly...
We prove a new switching lemma that works for restrictions that set only a small fraction of the var...
Recently there has been much interest in understanding why deep neural networks are preferred to sha...
Approximation theory studies the process of approaching arbitrary functions by simple func-tions dep...
The usual OBDD-data structure can easily be equipped with nondeterminism by allowing several edges w...
National audienceWe study the expressivity of sparsely connected deep networks. Measuring a network'...
This paper gives the first separation between the power of formulas and circuits of equal depth in ...
DOI
Add to ORKG