A lower bound for the complexity of information networks for one partial order relation (Q3125980)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A lower bound for the complexity of information networks for one partial order relation |
scientific article |
Statements
A lower bound for the complexity of information networks for one partial order relation (English)
0 references
23 March 1997
0 references
search problems
0 references
