Name
Abstract | ||
|---|---|---|
Two left and right horizontal absorbed projections along a single direction uniquely determine a row of a binary matrix. After proving this result we give a polynomial time algorithm which reconstructs such a row and we analyze its performances by determining the worst case complexity. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1016/S1571-0653(04)00479-2 | Electronic Notes in Discrete Mathematics |
Field | DocType | Volume |
Discrete mathematics,Combinatorics,Logical matrix,Algorithm,Left and right,Time complexity,Worst-case complexity,Mathematics | Journal | 12 |
ISSN | Citations | PageRank |
1571-0653 | 2 | 0.64 |
References | Authors | |
1 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Elena Barcucci | 1 | 306 | 59.66 |
| Andrea Frosini | 2 | 101 | 20.44 |
| Simone Rinaldi | 3 | 174 | 24.93 |