30 citations · 61 across the 15 of their papers we have counts for
Showing 2014Show all
2 papers · 1 filter
cs.CC2014
Learning circuits with few negations
Eric Blais, Clément L. Canonne, Igor C. Oliveira +2
Monotone Boolean functions, and the monotone Boolean circuits that compute them, have been intensively studied in complexity theory. In this paper we study the structure of Boolean…
math.CO2014
Erdős-Ko-Rado for random hypergraphs: asymptotics and stability
Marcelo M. Gauy, Hiêp Hàn, Igor C. Oliveira
We investigate the asymptotic version of the Erdős-Ko-Rado theorem for the random -uniform hypergraph . For , let and $D…