scientific article; zbMATH DE number 2032311

MaRDI QIDQ4446133zbMATH OpenFDO

Authors A. V. Lakeyev

Publication date 26 January 2004

Full work available at URL http://www-sbras.nsc.ru/win/mathpub/comp-tech/scripts/user/db_view_abs.phtml?ar_ind=408&lang=eng

zbMATH Keywords

controllable solutioneasy computable functionquantifier

Mathematics Subject Classification ID

Interval and finite arithmetic (65G30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Complexity of some linear problems with interval data
• Calculation of exact bounds for the solution set of linear interval systems
• scientific article; zbMATH DE number 804135
• Checking bounds on solutions of linear interval equations is NP-hard
• NP-hard classes of linear algebraic systems with uncertainties

Cited in

(6)

• Complexity of some linear problems with interval data
• On the computational complexity of the solution of linear systems with moduli
• Sufficient conditions for the significance of the coefficients of linear models and the polynomial-time complexity of their determination from data with interval uncertainty
• scientific article; zbMATH DE number 1560347 (Why is no real title available?)
• scientific article; zbMATH DE number 1396574 (Why is no real title available?)
• On the Complexity of Computing Estimates of Condition Measures of a Conic Linear System

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4446133)