The following pages link to Ramamohan Paturi (Q192223):
Displayed 36 items.
- Probabilistic communication complexity (Q579927) (← links)
- Milking the Aanderaa argument (Q918198) (← links)
- There are no p-complete families of symmetric Boolean functions (Q1114662) (← links)
- Universal traversal sequences of length \(n^{0(\log \,n)}\) for cliques (Q1117703) (← links)
- Effect of connectivity in an associative memory model (Q1309388) (← links)
- Approximating threshold circuits by rational functions (Q1333272) (← links)
- Exponential lower bounds for depth three Boolean circuits (Q1590079) (← links)
- Which problems have strongly exponential complexity? (Q1604206) (← links)
- The light bulb problem (Q1892873) (← links)
- On the exact complexity of evaluating quantified \(k\)-\textsc{cnf} (Q1949746) (← links)
- Subquadratic algorithms for succinct stable matching (Q2415371) (← links)
- The complexity of Unique \(k\)-SAT: An isolation lemma for \(k\)-CNFs (Q2475410) (← links)
- Nondeterministic Extensions of the Strong Exponential Time Hypothesis and Consequences for Non-reducibility (Q2800573) (← links)
- Finding Heavy Hitters from Lossy or Noisy Data (Q2851870) (← links)
- On the complexity of circuit satisfiability (Q2875150) (← links)
- Jealousy Graphs: Structure and Complexity of Decentralized Stable Matching (Q2937763) (← links)
- On the Exact Complexity of Evaluating Quantified k-CNF (Q3058691) (← links)
- k-SAT Is No Harder Than Decision-Unique-k-SAT (Q3392942) (← links)
- An improved exponential-time algorithm for <i>k</i> -SAT (Q3546306) (← links)
- The Complexity of Satisfiability of Small Depth Circuits (Q3656852) (← links)
- (Q4013544) (← links)
- Dimension of Projections in Boolean Functions (Q4210227) (← links)
- Size--Depth Tradeoffs for Threshold Circuits (Q4337668) (← links)
- (Q4484662) (← links)
- (Q4526973) (← links)
- Beating Brute Force for Systems of Polynomial Equations over Finite Fields (Q4575891) (← links)
- (Q4607895) (← links)
- Common Knowledge and State-Dependent Equilibria (Q4910936) (← links)
- Uniquely Satisfiable k-SAT Instances with Almost Minimal Occurrences of Each Variable (Q4930606) (← links)
- On Problems as Hard as CNF-SAT (Q4962605) (← links)
- (Q5111351) (← links)
- Size-depth trade-offs for threshold circuits (Q5248524) (← links)
- (Q5460925) (← links)
- (Q5743451) (← links)
- Scalable network architectures using the optical transpose interconnection system (OTIS) (Q5938657) (← links)
- On the complexity of \(k\)-SAT (Q5943094) (← links)