Samik Sengupta, Ph.D.
Affiliations: | 2004 | State University of New York, Buffalo, Buffalo, NY, United States |
Area:
Computer ScienceGoogle:
"Samik Sengupta"Parents
Sign in to add mentorAlan L. Selman | grad student | 2004 | SUNY Buffalo | |
(Structural properties of NP and coNP.) |
BETA: Related publications
See more...
Publications
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
Glaber C, Pavan A, Selman AL, et al. (2006) Properties of NP-complete sets Siam Journal On Computing. 36: 516-542 |
Glasser C, Selman AL, Sengupta S, et al. (2004) Disjoint NP-pairs Siam Journal On Computing. 33: 1369-1416 |
Selman AL, Sengupta S. (2004) Polylogarithmic-round interactive proofs for coNP collapse the exponential hierarchy Proceedings of the Annual Ieee Conference On Computational Complexity. 19: 82-90 |
Glaßer C, Selman AL, Sengupta S. (2004) Reductions between disjoint NP-pairs Proceedings of the Annual Ieee Conference On Computational Complexity. 19: 42-53 |