8298 search results - page 79 / 1660 » On the Complexity of Numerical Analysis |
177
click to vote
MP
2011
15 years 1 months ago
2011
We perform a smoothed analysis of Renegar’s condition number for linear programming by analyzing the distribution of the distance to ill-posedness of a linear program subject to...
157
click to vote
CSCLP
2005
Springer
15 years 11 months ago
2005
Springer
CSP search algorithms are exponential in the worst-case. A trivial upper bound on the time complexity of CSP search algorithms is O∗ (dn ), where n and d are the number of variab...
191
click to vote
INFORMATICALT
2010
15 years 4 months ago
2010
The genetic information in cells is stored in DNA sequences, represented by a string of four letters, each corresponding to a definite type of nucleotides. Genomic DNA sequences a...
181
click to vote
DAC
1999
ACM
15 years 10 months ago
1999
ACM
This paper presents a method to reduce the complexity of a linear or linearized (small-signal) analog circuit. The reduction technique, based on quality-error ranking, can be used...
142
click to vote
AML
2007
15 years 6 months ago
2007
Abstract. This research is motivated by the program of Reverse Mathematics. We investigate basic part of complex analysis within some weak subsystems of second order arithmetic, in...