Samik Sengupta

According to our database, Samik Sengupta authored at least 11 papers between 1997 and 2008.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2008

Proving SAT does not have small circuits with an application to the two queries problem.

Lance Fortnow, Aduri Pavan, Samik Sengupta

J. Comput. Syst. Sci., 2008

2007

Polylogarithmic-round interactive proofs for coNP collapse the exponential hierarchy.

Aduri Pavan, Alan L. Selman, Samik Sengupta, N. V. Vinodchandran

Theor. Comput. Sci., 2007

2006

Properties of NP-Complete Sets.

Christian Glaßer, Aduri Pavan, Alan L. Selman, Samik Sengupta

SIAM J. Comput., 2006

2004

Disjoint NP-Pairs.

Christian Glaßer, Alan L. Selman, Samik Sengupta, Liyu Zhang

SIAM J. Comput., 2004

On Higher Arthur-Merlin Classes.

Jin-yi Cai, Denis Charles, Aduri Pavan, Samik Sengupta

Int. J. Found. Comput. Sci., 2004

Polylogarithmic-round Interactive Proofs for coNP Collapses the Exponential Hierarchy

Alan L. Selman, Samik Sengupta

Electron. Colloquium Comput. Complex., 2004

A Protocol for Serializing Unique Strategies.

Marcel Crâsmaru, Christian Glaßer, Kenneth W. Regan, Samik Sengupta

Proceedings of the Mathematical Foundations of Computer Science 2004, 2004

Polylogarithmic-Round Interactive Proofs for coNP Collapse the Exponential Hierarchy.

Alan L. Selman, Samik Sengupta

Proceedings of the 19th Annual IEEE Conference on Computational Complexity (CCC 2004), 2004

2003

Reductions between Disjoint NP-Pairs

Christian Glaßer, Alan L. Selman, Samik Sengupta

Electron. Colloquium Comput. Complex., 2003

Proving SAT does not have Small Circuits with an Application to the Two.

Lance Fortnow, Aduri Pavan, Samik Sengupta

Proceedings of the 18th Annual IEEE Conference on Computational Complexity (Complexity 2003), 2003

1997

Architectures for Arithmetic over GF(2^m).

Rana Barua, Samik Sengupta

Proceedings of the 10th International Conference on VLSI Design (VLSI Design 1997), 1997