Samik Sengupta

Publication Activity (10 Years)

Years Active: 1997-2008
Publications (10 Years): 0

Publications

Lance Fortnow, Aduri Pavan, Samik Sengupta
Proving SAT does not have small circuits with an application to the two queries problem. J. Comput. Syst. Sci. 74 (3) (2008)
Aduri Pavan, Alan L. Selman, Samik Sengupta, N. V. Vinodchandran
Polylogarithmic-round interactive proofs for coNP collapse the exponential hierarchy. Theor. Comput. Sci. 385 (1-3) (2007)
Christian Glaßer, Aduri Pavan, Alan L. Selman, Samik Sengupta
Properties of NP-Complete Sets. SIAM J. Comput. 36 (2) (2006)
Christian Glaßer, Alan L. Selman, Samik Sengupta
Reductions between disjoint NP-Pairs. Inf. Comput. 200 (2) (2005)
Christian Glaßer, Alan L. Selman, Samik Sengupta, Liyu Zhang
Disjoint NP-Pairs. SIAM J. Comput. 33 (6) (2004)
Christian Glaßer, Alan L. Selman, Samik Sengupta
Reductions between Disjoint NP-Pairs. Computational Complexity Conference (2004)
Christian Glaßer, Aduri Pavan, Alan L. Selman, Samik Sengupta
Properties of NP-Complete Sets. Computational Complexity Conference (2004)
Marcel Crâsmaru, Christian Glaßer, Kenneth W. Regan, Samik Sengupta
A Protocol for Serializing Unique Strategies. MFCS (2004)
Alan L. Selman, Samik Sengupta
Polylogarithmic-Round Interactive Proofs for coNP Collapse the Exponential Hierarchy. Computational Complexity Conference (2004)
Jin-yi Cai, Denis Charles, Aduri Pavan, Samik Sengupta
On Higher Arthur-Merlin Classes. Int. J. Found. Comput. Sci. 15 (1) (2004)
Christian Glaßer, Aduri Pavan, Alan L. Selman, Samik Sengupta
Properties of NP-Complete Sets Electron. Colloquium Comput. Complex. (019) (2004)
Alan L. Selman, Samik Sengupta
Polylogarithmic-round Interactive Proofs for coNP Collapses the Exponential Hierarchy Electron. Colloquium Comput. Complex. (007) (2004)
Lance Fortnow, Aduri Pavan, Samik Sengupta
Proving SAT does not have Small Circuits with an Application to the Two. Computational Complexity Conference (2003)
Christian Glaßer, Alan L. Selman, Samik Sengupta
Reductions between Disjoint NP-Pairs Electron. Colloquium Comput. Complex. 10 (027) (2003)
Christian Glaßer, Alan L. Selman, Samik Sengupta, Liyu Zhang
Disjoint NP-Pairs. Computational Complexity Conference (2003)
Christian Glaßer, Alan L. Selman, Samik Sengupta, Liyu Zhang
Disjoint NP-Pairs Electron. Colloquium Comput. Complex. 10 (011) (2003)
Jin-yi Cai, Denis Charles, Aduri Pavan, Samik Sengupta
On Higher Arthur-Merlin Classes. COCOON (2002)
Rana Barua, Samik Sengupta
). VLSI Design (1997)