The following pages link to Ramamohan Paturi (Q192223):
Displaying 19 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)
- (Q5111351) (← links)
