Abstract | ||
---|---|---|
A semi-commutation REG\mathcal{R}\mathcal{E}\mathcal{G}
-compatible with a semi-commutation REG\mathcal{R}\mathcal{E}\mathcal{G}
-compatible semi-commutations. The complexity of the problem is shown to be co-NP-complete. |
Year | DOI | Venue |
---|---|---|
1993 | 10.1007/3-540-56939-1_93 | ICALP |
Keywords | Field | DocType |
regular compatibility | Discrete mathematics,Combinatorics,Compatibility (mechanics),Computer science,Decidability | Conference |
ISBN | Citations | PageRank |
3-540-56939-1 | 5 | 0.58 |
References | Authors | |
6 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Edward Ochmanski | 1 | 185 | 20.46 |
Pierre-andré Wacrenier | 2 | 766 | 36.69 |