scientific article; zbMATH DE number 139625

zbMATH Open0782.68066MaRDI QIDQ4029604FDOQ4029604

Authors: Edward W. Packel 

Publication date: 28 March 1993

Title of this publication is not available (Why is that?)

Recommendations

• Do Linear Problems Have Linear Optimal Algorithms?
• Some issues in the theory of optimal algorithms and informational complexity
• Average case optimality for linear problems
• Recent developments in information-based complexity
• scientific article; zbMATH DE number 822135

zbMATH Keywords

information-based complexitytheory of optimal algorithms

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Cited In (9)

• Linearity of algorithms and a result of Ando
• A decision procedure for linear ``big O equations
• Are linear algorithms always good for linear problems?
• Linear problems (with extended range) have linear optimal algorithms
• Title not available (Why is that?)
• Optimal algorithms for linear problems with Gaussian measures
• On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimension
• Title not available (Why is that?)
• Can linear superiorization be useful for linear optimization problems?

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 Q4029604)