400 search results - page 8 / 80 » Derandomization and Distinguishing Complexity |
COCO
2001
Springer
15 years 2 months ago
2001
Springer
Restricting the search space {0, 1}n to the set of truth tables of “easy” Boolean functions on log n variables, as well as using some known hardness-randomness tradeoffs, we ...
COMPLEX
2009
Springer
15 years 4 months ago
2009
Springer
Although recent research has shown that the complexity of a network depends on its structural organization, which is linked to the functional constraints the network must satisfy, ...
80
Voted
APPROX
2009
Springer
15 years 4 months ago
2009
Springer
Small-bias, or -biased, spaces have found many applications in complexity theory, coding theory, and derandomization. We generalize the notion of small-bias spaces to the setting ...
95
Voted
COCO
1998
Springer
15 years 1 months ago
1998
Springer
We show that the perfect matching problem is in the complexity class SPL in the nonuniform setting. This provides a better upper bound on the complexity of the matching problem, a...
GECCO
2007
Springer
15 years 3 months ago
2007
Springer
The Second Harmonic Generation (SHG), a process that turns out to be a good test case in the physics lab, can also be considered as a fairly simple theoretical test function for g...