Dividing and conquering the square

DOI10.1016/0166-218X(93)90004-8zbMath0783.68058OpenAlexW2052642357MaRDI QIDQ1801677

Yanyan Li

Publication date: 17 August 1993

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(93)90004-8

zbMATH Keywords

graphupper boundslocal searchlower boundsaddle pointgridlocal minimum of a matrix

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Determinants, permanents, traces, other special matrix functions (15A15) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (3)

On the black-box complexity of Sperner's Lemma ⋮ Quantum and classical query complexities of local search are polynomially related ⋮ Enhanced algorithms for local search

Cites Work

• Local optimization on graphs
• Lower bounds on the worst-case complexity of some oracle algorithms
• On the deterministic complexity of searching local maxima
• Generalized Nested Dissection
• Best Algorithms for Approximating the Maximum of a Submodular Set Function

This page was built for publication: Dividing and conquering the square