Samik Sengupta
From MaRDI portal
Person:2387198
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 |
|---|---|---|
| Proving SAT does not have small circuits with an application to the two queries problem Journal of Computer and System Sciences | 2008-03-11 | Paper |
| Polylogarithmic-round interactive proofs for coNP collapse the exponential hierarchy Theoretical Computer Science | 2007-10-18 | Paper |
| Properties of NP‐Complete Sets SIAM Journal on Computing | 2007-05-03 | Paper |
| ON HIGHER ARTHUR-MERLIN CLASSES International Journal of Foundations of Computer Science | 2005-10-19 | Paper |
| Reductions between disjoint NP-pairs Information and Computation | 2005-09-02 | Paper |
| Mathematical Foundations of Computer Science 2004 Lecture Notes in Computer Science | 2005-08-22 | Paper |
| Disjoint NP-Pairs SIAM Journal on Computing | 2005-02-21 | Paper |
| scientific article; zbMATH DE number 2089956 (Why is no real title available?) | 2004-08-12 | Paper |
Research outcomes over time
This page was built for person: Samik Sengupta
