9842 search results - page 116 / 1969 » Problem complexity |
MFCS
2005
Springer
15 years 3 months ago
2005
Springer
We investigate the complexity of finding prime implicants and minimal equivalent DNFs for Boolean formulas, and of testing equivalence and isomorphism of monotone formulas. For DN...
ESOP
2009
Springer
15 years 1 months ago
2009
Springer
The context-free language (CFL) reachability problem is well known and studied in computer science, as a fundamental problem underlying many important static analyses such as point...
FLAIRS
2003
14 years 11 months ago
2003
Researchers studying Evolutionary Algorithms and their applications have always been confronted with the sample complexity problem. The relationship between population size and gl...
CSL
2005
Springer
15 years 3 months ago
2005
Springer
Implementations of real number computations have largely been unusable in practice because of their very bad performance, especially in comparison to floating point arithmetic imp...
CAINE
2006
14 years 11 months ago
2006
There is a tendency to overlook or play down software issues in industrial systems design. However the very best hardware will only be as effective as the programs that control it...