Reconstructing a binary matrix under timetabling constraints (Q3439178)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5158018
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Reconstructing a binary matrix under timetabling constraints |
scientific article; zbMATH DE number 5158018 |
Statements
Reconstructing a binary matrix under timetabling constraints (English)
0 references
29 May 2007
0 references
discrete tomography
0 references
binary matrix
0 references
directed acyclic graph
0 references
polynomial time algorithm
0 references
dynamic programming
0 references
0.99412704
0 references
0 references
0.88683486
0 references
0.86658937
0 references
0.85806876
0 references
0.8457073
0 references
0.8392291
0 references
0.83567107
0 references
0 references
