On the bit complexity of minimum link paths

1996 ◽  
Author(s):  
Simon Kahan ◽  
Jack Snoeyink
Keyword(s):  
Bit Complexity

scholarly journals On the bit complexity of polynomial system solving

2019 ◽  
Vol 51 ◽  
pp. 20-67 ◽  
Author(s):  
Nardo Giménez ◽  
Guillermo Matera
Keyword(s):  
Polynomial System ◽  
Polynomial System Solving ◽  
Bit Complexity

scholarly journals On the bit-complexity of sparse polynomial and series multiplication

2013 ◽  
Vol 50 ◽  
pp. 227-254 ◽  
Author(s):  
Joris van der Hoeven ◽  
Grégoire Lecerf
Keyword(s):  
Sparse Polynomial ◽  
Bit Complexity

The bit complexity of the predecessor problem

1997 ◽  
Vol 63 (2) ◽  
pp. 109-112
Author(s):  
Y. Afek ◽  
M. Cohen ◽  
E. Haalman
Keyword(s):  
Bit Complexity

Approximate Euclidean Shortest Paths in 3-Space

1997 ◽  
Vol 07 (04) ◽  
pp. 271-295 ◽  
Author(s):  
Joonsoo Choi ◽  
Juergen Sellen ◽  
Chee-Keng Yap
Keyword(s):  
Shortest Paths ◽  
Original Description ◽  
Floating Point ◽  
Elementary Functions ◽  
Complexity Bounds ◽  
Approximation Approach ◽  
Practical Algorithms ◽  
Euclidean Shortest Path ◽  
Complete Treatment ◽  
Bit Complexity

Papadimitriou's approximation approach to the Euclidean shortest path (ESP) in 3-space is revisited. As this problem is NP-hard, his approach represents an important step towards practical algorithms. However, there are several gaps in the original description. Besides giving a complete treatment in the framework of bit complexity, we also improve on his subdivision method. Among the tools needed are root-separation bounds and nontrivial applications of Brent's complexity bounds on evaluation of elementary functions using floating point numbers.

Sign in / Sign up

Export Citation Format

Share Document