On Problems as Hard as CNF-SAT von Cygan, Marek, Dell, Holger, Lokshtanov, Daniel, Marx, Dániel, Nederlof, Jesper, Okamoto, Yoshio, Paturi, Ramamohan, Saurabh, Saket, Wahlström, Magnus

Volltext

The Complexity of Satisfiability of Small Depth Circuits von Calabro, Chris, Impagliazzo, Russell, Paturi, Ramamohan

Volltext

Human matching behavior in social networks: an algorithmic perspective von Coviello, Lorenzo, Franceschetti, Massimo, McCubbins, Mathew D, Paturi, Ramamohan, Vattani, Andrea

Volltext

Which Problems Have Strongly Exponential Complexity? von Impagliazzo, Russell, Paturi, Ramamohan, Zane, Francis

Volltext

On the Complexity of k-SAT von Impagliazzo, Russell, Paturi, Ramamohan

Volltext

Subquadratic Algorithms for Succinct Stable Matching von Künnemann, Marvin, Moeller, Daniel, Paturi, Ramamohan, Schneider, Stefan

Volltext

The complexity of Unique k-SAT: An Isolation Lemma for k-CNFs von Calabro, Chris, Impagliazzo, Russell, Kabanets, Valentine, Paturi, Ramamohan

Volltext

An improved exponential-time algorithm for k -SAT von Paturi, Ramamohan, Pudlak, Pavel, Saks, Michael E, Zane, Francis

Volltext

On the Exact Complexity of Evaluating Quantified k-CNF von Calabro, Chris, Impagliazzo, Russell, Paturi, Ramamohan

Volltext

Size-depth tradeoffs for threshold circuits von IMPAGLIAZZO, R, PATURI, R, SAKS, M. E

Volltext

On the Exact Complexity of Evaluating Quantified k-CNF: Parameterized and Exact Computation, Part II von CALABRO, Chris, IMPAGLIAZZO, Russell, PATURI, Ramamohan

Volltext

Exact Algorithms and Complexity von Paturi, Ramamohan

Volltext

On Problems as Hard as CNF-SAT von Cygan, Marek, Dell, Holger, Lokshtanov, Daniel, Marx, D'niel, Nederlof, Jesper, Okamoto, Yoshio, Paturi, Ramamohan, Saurabh, Saket, Wahlstrom, Magnus

Volltext

On Extremal Properties of k-CNF: Capturing Threshold Functions von Gurumukhani, Mohit, Künnemann, Marvin, Paturi, Ramamohan

Volltext bestellen

Subquadratic Algorithms for Succinct Stable Matching von Moeller, Daniel, Paturi, Ramamohan, Schneider, Stefan

Volltext

Probabilistic communication complexity von Paturi, Ramamohan, Simon, Janos

Volltext

Connected Coordination: Network Structure and Group Coordination von McCubbins, Mathew D., Paturi, Ramamohan, Weller, Nicholas

Volltext

Uniquely Satisfiable k-SAT Instances with Almost Minimal Occurrences of Each Variable von Matthews, William, Paturi, Ramamohan

Volltext

k-SAT Is No Harder Than Decision-Unique-k-SAT von Calabro, Chris, Paturi, Ramamohan

Volltext

Local Enumeration and Majority Lower Bounds von Gurumukhani, Mohit, Paturi, Ramamohan, Pudlák, Pavel, Saks, Michael, Talebanfard, Navid

Volltext bestellen