6568 search results - page 312 / 1314 » Reducing the Complexity of Reductions |
166
click to vote
COCO
2004
Springer
15 years 10 months ago
2004
Springer
Juedes and Lutz (1995) proved a small span theorem for polynomial-time many-one reductions in exponential time. This result says that for language A decidable in exponential time,...
144
click to vote
HICSS
2003
IEEE
16 years 4 days ago
2003
IEEE
In order to implement real-time adaptive augmented cognition, one of the focal points of our present research involves understanding the dimensions of task complexity. Task comple...
187
click to vote
JCP
2008
15 years 6 months ago
2008
Complex numbers play a very important role in various applications of electrical and computer engineering. These days, arithmetic operations dealing with these numbers rely on a &q...
194
Voted
CASCON
1996
15 years 8 months ago
1996
"Anything that one cannot measure cannot be controlled." Software metrics provide insight into the quality of software, informing the developers about the status of a pr...
163
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
The complexity of round robin iterative data flow analysis has been traditionally defined as 1+d where d is the depth of a control flow graph. However, this bound is restricted to ...