1450 search results - page 232 / 290 » On the Complexity of Hardness Amplification |
144
click to vote
DATE
2008
IEEE
16 years 19 days ago
2008
IEEE
Embedded systems are often operating under hard real-time constraints. Such systems are naturally described as time-bound reactions to external events, a point of view made manife...
179
click to vote
FDL
2008
IEEE
16 years 19 days ago
2008
IEEE
Constraint-based random simulation is state-of-the-art in verification of multi-million gate industrial designs. This method is based on stimulus generation by constraint solving...
180
click to vote
FOCS
2008
IEEE
16 years 19 days ago
2008
IEEE
Learning problems form an important category of computational tasks that generalizes many of the computations researchers apply to large real-life data sets. We ask: what concept ...
159
click to vote
FOCS
2008
IEEE
16 years 19 days ago
2008
IEEE
Razborov and Rudich have shown that so-called natural proofs are not useful for separating P from NP unless hard pseudorandom number generators do not exist. This famous result is...
153
click to vote
KBSE
2007
IEEE
16 years 13 days ago
2007
IEEE
Automating the generation of object-oriented unit tests is a challenging task. This is mainly due to the complexity and peculiarities that the principles of object-orientation imp...