On the IO-complexity and approximation languages (Q1112018)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the IO-complexity and approximation languages |
scientific article; zbMATH DE number 4077189
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the IO-complexity and approximation languages |
scientific article; zbMATH DE number 4077189 |
Statements
On the IO-complexity and approximation languages (English)
0 references
1988
0 references
The existence of intractable problems has raised several questions whether such problems can be solved ``on average''. The present paper introduces the IO-complexity (the conditions meet infinitely often, in contrast with the traditional case when they are fulfilled almost everywhere), and studies some connections between it and the notion of approximation solutions.
0 references
IO-complexity
0 references
infinitely often
0 references
approximation solutions
0 references
