A probabilistic analysis of a measure of combinatorial complexity for the central curve

DOI10.1007/S101079900125zbMath0959.90053OpenAlexW178709817MaRDI QIDQ1970302

Sushil Verma, Peter A. Beling

Publication date: 26 April 2001

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s101079900125

zbMATH Keywords

linear complementarityprobabilistic analysiscombinatorial complexitycentral curve

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

This page was built for publication: A probabilistic analysis of a measure of combinatorial complexity for the central curve