On the Exact Worst Case Query Complexity of Planar Point Location

ISSN： 0196-6774

Source： Journal of Algorithms, Vol.37, Iss.1, 2000-10, pp. : 189-217

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Complexity of Neural Network Approximation with Limited Information: A Worst Case Approach

By Kon M. Plaskota L.

Journal of Complexity, Vol. 17, Iss. 2, 2001-06 ,pp. : 345-365

Academic Press

Access to resources Recommend Favorite

Worst case complexity of multivariate Feynman-Kac path integration

By Kwas M. Li Y.

Journal of Complexity, Vol. 19, Iss. 6, 2003-12 ,pp. : 730-743

Elsevier

Access to resources Recommend Favorite

Smoothing and worst-case complexity for direct-search methods in nonsmooth optimization

By Garmanjani R. Vicente L. N.

IMA Journal of Numerical Analysis, Vol. 33, Iss. 3, 2013-07 ,pp. : 1008-1028

Oxford University Press

Access to resources Recommend Favorite

A New Algorithm and Worst Case Complexity for Feynman–Kac Path Integration

By Plaskota L. Wasilkowski G.W. Woźniakowski H.

Journal of Computational Physics, Vol. 164, Iss. 2, 2000-11 ,pp. : 335-353

Academic Press

Access to resources Recommend Favorite

Worst-case evaluation complexity of non-monotone gradient-related algorithms for unconstrained optimization

Optimization, Vol. 64, Iss. 5, 2015-05 ,pp. : 1349-1361

Taylor & Francis Ltd

Access to resources Recommend Favorite