8 search results - page 2 / 2 » coco 1997 |
COCO
1997
Springer
13 years 11 months ago
1997
Springer
We study families of Boolean circuits with the property that the number of gates at distance t fanning into or out of any given gate in a circuit is bounded above by a polynomial ...
COCO
1997
Springer
13 years 11 months ago
1997
Springer
In this paper we design a nonadaptive NC checker for permutation group intersection, sharpening a result from Blum and Kannan 3]. This is a consequence of two results. First we sh...
COCO
2011
Springer
12 years 7 months ago
2011
Springer
—In 1997, H˚astad showed NP-hardness of (1 − , 1/q + δ)-approximating Max-3Lin(Zq); however it was not until 2007 that Guruswami and Raghavendra were able to show NP-hardness...