Samik Sengupta

18 papers A 5B 1Misc 2Journal 10
YearRankTypeTitle / Venue / Authors
2008 J jnl
Proving SAT does not have small circuits with an application to the two queries problem.
J. Comput. Syst. Sci.
Lance Fortnow, Aduri Pavan, Samik Sengupta
2007 J jnl
Polylogarithmic-round interactive proofs for coNP collapse the exponential hierarchy.
Theor. Comput. Sci.
Aduri Pavan, Alan L. Selman, Samik Sengupta, N. V. Vinodchandran
2006 J jnl
Properties of NP-Complete Sets.
SIAM J. Comput.
Christian Glaßer, Aduri Pavan, Alan L. Selman, Samik Sengupta
2005 J jnl
Reductions between disjoint NP-Pairs.
Inf. Comput.
Christian Glaßer, Alan L. Selman, Samik Sengupta
2004 B conf
A Protocol for Serializing Unique Strategies.
MFCS
Marcel Crâsmaru, Christian Glaßer, Kenneth W. Regan, Samik Sengupta
2004 J jnl
Disjoint NP-Pairs.
SIAM J. Comput.
Christian Glaßer, Alan L. Selman, Samik Sengupta, Liyu Zhang
2004 J jnl
On Higher Arthur-Merlin Classes.
Int. J. Found. Comput. Sci.
Jin-Yi Cai, Denis Charles, Aduri Pavan, Samik Sengupta
2004 A conf
Polylogarithmic-Round Interactive Proofs for coNP Collapse the Exponential Hierarchy.
CCC
Alan L. Selman, Samik Sengupta
2004 J jnl
Polylogarithmic-round Interactive Proofs for coNP Collapses the Exponential Hierarchy
Electron. Colloquium Comput. Complex.
Alan L. Selman, Samik Sengupta
2004 J jnl
Properties of NP-Complete Sets
Electron. Colloquium Comput. Complex.
Christian Glaßer, Aduri Pavan, Alan L. Selman, Samik Sengupta
2004 A conf
Properties of NP-Complete Sets.
CCC
Christian Glaßer, Aduri Pavan, Alan L. Selman, Samik Sengupta
2004 A conf
Reductions between Disjoint NP-Pairs.
CCC
Christian Glaßer, Alan L. Selman, Samik Sengupta
2003 J jnl
Disjoint NP-Pairs
Electron. Colloquium Comput. Complex.
Christian Glaßer, Alan L. Selman, Samik Sengupta, Liyu Zhang
2003 A conf
Disjoint NP-Pairs.
CCC
Christian Glaßer, Alan L. Selman, Samik Sengupta, Liyu Zhang
2003 A conf
Proving SAT does not have Small Circuits with an Application to the Two.
CCC
Lance Fortnow, Aduri Pavan, Samik Sengupta
2003 J jnl
Reductions between Disjoint NP-Pairs
Electron. Colloquium Comput. Complex.
Christian Glaßer, Alan L. Selman, Samik Sengupta
2002 Misc conf
On Higher Arthur-Merlin Classes.
COCOON
Jin-Yi Cai, Denis Charles, Aduri Pavan, Samik Sengupta
1997 Misc conf
Architectures for Arithmetic over GF(2
VLSI Design
Rana Barua, Samik Sengupta