19320 search results - page 40 / 3864 » On the complexity of computing determinants |
WG
2010
Springer
14 years 8 months ago
2010
Springer
The problem of determining the cutwidth of a graph is a notoriously hard problem which remains NP-complete under severe restrictions on input graphs. Until recently, non-trivial p...
WSC
1997
14 years 11 months ago
1997
A central quantity in steady-state simulation is the time-average variance constant. Estimates of this quantity are needed (for example) for constructing confidence intervals, an...
GMP
2006
IEEE
15 years 3 months ago
2006
IEEE
Skeletons are important shape descriptors in object representation and recognition. Typically, skeletons of volumetric models are computed using iterative thinning. However, tradi...
GRID
2005
Springer
15 years 3 months ago
2005
Springer
— QoS and congestion performance are crucial to good application performance in a utility computing environment. Unfortunately, proper IP QoS setup is very complex and is either ...
76
Voted
FSTTCS
2010
Springer
14 years 7 months ago
2010
Springer
A fundamental problem in numerical computation and computational geometry is to determine the sign of arithmetic expressions in radicals. Here we consider the simpler problem of d...