The following pages link to Samik Sengupta (Q2387198):
Displayed 8 items.
- Reductions between disjoint NP-pairs (Q2387199) (← links)
- Polylogarithmic-round interactive proofs for coNP collapse the exponential hierarchy (Q2456368) (← links)
- Proving SAT does not have small circuits with an application to the two queries problem (Q2475408) (← links)
- Properties of NP‐Complete Sets (Q3434997) (← links)
- Disjoint NP-Pairs (Q4651518) (← links)
- (Q4808618) (← links)
- Mathematical Foundations of Computer Science 2004 (Q5311139) (← links)
- ON HIGHER ARTHUR-MERLIN CLASSES (Q5696962) (← links)