8298 search results - page 6 / 1660 » On the Complexity of Numerical Analysis |
JACM
2000
14 years 9 months ago
2000
A deterministic algorithm for computing a minimum spanning tree of a connected graph is presented. Its running time is O(m (m, n)), where is the classical functional inverse of Ack...
CCE
2010
14 years 7 months ago
2010
The paper examines the applicability of mathematical programming methods to the simultaneous optimization of the structure and the operational parameters of a combined-cycle-based...
124
click to vote
TPHOL
2006
IEEE
15 years 3 months ago
2006
IEEE
This case study shows how ACL2 can be used to reason about the real and complex numbers, using non-standard analysis. It describes some modifications to ACL2 that include the irr...
STOC
2004
ACM
15 years 10 months ago
2004
ACM
DBPL
2005
Springer
2005
Springer
Complexity and Approximation of Fixing Numerical Attributes in Databases Under Integrity Constraints
15 years 3 months ago
Consistent query answering is the problem of computing the answers from a database that are consistent with respect to certain integrity constraints that the database as a whole ma...