Samik Sengupta

Publications

Citations

H-Index

2004

Active since

Affiliations

University at Buffalo, State University of New York(Current)

Samik Sengupta is an author at University at Buffalo, State University of New York specializing in engineering, computational complexity, and discrete mathematics.

Top concepts

EngineeringFormal MethodsComputer ScienceProof ComplexityDiscrete MathematicsComputational ComplexityGraph TheoryVerificationSatisfiabilityCircuit Complexity

Publications per year

2004–2007

Publications

Disjoint NP-Pairs

Alan L. Selman, Samik Sengupta, Liyu Zhang · SIAM Journal on Computing · 2004 · 47 citations

Complete Pair, Engineering, Automated Reasoning +11

Reductions between disjoint NP-Pairs

Christian Glaßer, Alan L. Selman, Samik Sengupta · Information and Computation · 2005 · 25 citations

Engineering, Graph Theory, Computational Complexity +4

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

Lance Fortnow, A. Pavan, Samik Sengupta · Journal of Computer and System Sciences · 2007 · 16 citations

Circuit Complexity, Queries Problem, Engineering +9

Rows per page

1–3 of 3