Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

Average complexity for linear problems in a model with varying information noise

From MaRDI portal
Publication:1893075
Jump to:navigation, search

DOI10.1006/JCOM.1995.1010zbMath0828.68090OpenAlexW1969388999MaRDI QIDQ1893075

Leszek Plaskota

Publication date: 2 January 1996

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcom.1995.1010


zbMATH Keywords

cost functioninformation complexity


Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)


Related Items (1)

Complexity of approximating Hölder classes from information with varying Gaussian noise







This page was built for publication: Average complexity for linear problems in a model with varying information noise

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1893075&oldid=14300469"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
This page was last edited on 1 February 2024, at 12:18.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki