Anthony Mansfield
From MaRDI portal
Person:1170030
Available identifiers
zbMath Open mansfield.anthonyMaRDI QIDQ1170030
List of research outcomes
 | This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon! |
| Publication | Date of Publication | Type |
|---|---|---|
| Determining the thickness of graphs is NP-hard | 1983-01-01 | Paper |
| On the computational complexity of a merge recognition problem | 1983-01-01 | Paper |
| THE RELATIONSHIP BETWEEN THE COMPUTATIONAL COMPLEXITIES OF THE LEGITIMATE DECK AND ISOMORPHISM PROBLEMS | 1982-01-01 | Paper |
| An algorithm for a merge recognition problem | 1982-01-01 | Paper |
| On the Computational Complexity of a Rigidity Problem | 1981-01-01 | Paper |
Research outcomes over time
This page was built for person: Anthony Mansfield
