380 search results - page 23 / 76 » A Categorical Setting for Lower Complexity |
103
click to vote
FOCS
1999
IEEE
15 years 4 months ago
1999
IEEE
This paper connects two fundamental ideas from theoretical computer science: hard-core set construction, a type of hardness amplification from computational complexity, and boosti...
136
Voted
PODC
2010
ACM
15 years 3 months ago
2010
ACM
An edge dominating set for a graph G is a set D of edges such that each edge of G is in D or adjacent to at least one edge in D. This work studies deterministic distributed approx...
CORR
1999
Springer
14 years 11 months ago
1999
Springer
It is known that for any class C closed under union and intersection, the Boolean closure of C, the Boolean hierarchy over C, and the symmetric difference hierarchy over C all are ...
SODA
2010
ACM
15 years 9 months ago
2010
ACM
d Abstract) Hanna Mazzawi Technion - Israel Institute of Technology In this paper, we consider the problem of reconstructing a hidden graph with m edges using additive queries. Gi...
82
Voted
DCC
2005
IEEE
15 years 11 months ago
2005
IEEE
A certificate of authenticity (COA) is an inexpensive physical object that has a random unique structure with high cost of near-exact reproduction. An additional requirement is th...