Arvind Gupta
From MaRDI portal
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 |
|---|---|---|
| scientific article; zbMATH DE number 1341910 (Why is no real title available?) | 2000-02-23 | Paper |
| The complexity of minimum partial truth assignments and implication in negation-free formulae Annals of Mathematics and Artificial Intelligence | 1998-07-19 | Paper |
| Finding largest subtrees and smallest supertrees Algorithmica | 1998-06-08 | Paper |
| Vertex partitioning problems on partial k-trees Algorithm Theory — SWAT'96 | 1998-05-04 | Paper |
| Bounding the Size of Planar Intertwines SIAM Journal on Discrete Mathematics | 1998-02-09 | Paper |
| Using amplification to compute majority with small majority gates Computational Complexity | 1997-09-07 | Paper |
Research outcomes over time
This page was built for person: Arvind Gupta
