Russell Impagliazzo

Results: 30



#Item
1A Personal View of Average-Case Complexity Russell Impagliazzo Computer Science and Engineering UC, San Diego 9500 Gilman Drive La Jolla, CA

A Personal View of Average-Case Complexity Russell Impagliazzo Computer Science and Engineering UC, San Diego 9500 Gilman Drive La Jolla, CA

Add to Reading List

Source URL: www.karlin.mff.cuni.cz

Language: English - Date: 2011-12-13 09:31:41
2Randomness vs. Time: De-randomization under a uniform assumption Russell Impagliazzo∗ Department of Computer Science University of California San Diego, CA

Randomness vs. Time: De-randomization under a uniform assumption Russell Impagliazzo∗ Department of Computer Science University of California San Diego, CA

Add to Reading List

Source URL: www.math.ias.edu

Language: English - Date: 2002-04-25 06:22:12
    3P=BPP unless E has sub-exponential circuits: Derandomizing the XOR Lemma Russell Impagliazzo∗ Avi Wigderson† Department of Computer Science Institute of Computer Science University of California

    P=BPP unless E has sub-exponential circuits: Derandomizing the XOR Lemma Russell Impagliazzo∗ Avi Wigderson† Department of Computer Science Institute of Computer Science University of California

    Add to Reading List

    Source URL: www.math.ias.edu

    Language: English - Date: 2002-04-25 07:26:00
      4Pseudorandomness for Network Algorithms Russell Impagliazzo ∗ Noam Nisan

      Pseudorandomness for Network Algorithms Russell Impagliazzo ∗ Noam Nisan

      Add to Reading List

      Source URL: www.math.ias.edu

      Language: English - Date: 2002-04-25 11:03:21
        5EATCS-IPEC Nerode Prize 2013 On the Exact Complexity of Evaluating Quantified k-CNF Chris Calabro, Russell Impagliazzo, Ramamohan Paturi, Algorithmica 2013 The complexity of Unique k-SAT: An Isolation Lemma for k-CNFs

        EATCS-IPEC Nerode Prize 2013 On the Exact Complexity of Evaluating Quantified k-CNF Chris Calabro, Russell Impagliazzo, Ramamohan Paturi, Algorithmica 2013 The complexity of Unique k-SAT: An Isolation Lemma for k-CNFs

        Add to Reading List

        Source URL: cseweb.ucsd.edu

        Language: English - Date: 2013-09-30 10:45:02
          6A Satisfiability Algorithm for AC0 Russell Impagliazzo ∗ William Matthews

          A Satisfiability Algorithm for AC0 Russell Impagliazzo ∗ William Matthews

          Add to Reading List

          Source URL: cseweb.ucsd.edu

          Language: English - Date: 2013-09-30 22:11:42
            7Which Problems Have Strongly Exponential Complexity? Russell Impagliazzo, Ramamohan Paturi University of California, San Diego Francis Zane Bell Laboratories, Lucent Technologies

            Which Problems Have Strongly Exponential Complexity? Russell Impagliazzo, Ramamohan Paturi University of California, San Diego Francis Zane Bell Laboratories, Lucent Technologies

            Add to Reading List

            Source URL: cseweb.ucsd.edu

            Language: English - Date: 2013-10-01 17:24:14
              8Journal of Computer and System Sciences 63, 512–doi:jcss, available online at http://www.idealibrary.com on Which Problems Have Strongly Exponential Complexity? 1 Russell Impagliazzo and Ra

              Journal of Computer and System Sciences 63, 512–doi:jcss, available online at http://www.idealibrary.com on Which Problems Have Strongly Exponential Complexity? 1 Russell Impagliazzo and Ra

              Add to Reading List

              Source URL: cseweb.ucsd.edu

              Language: English - Date: 2013-10-01 17:18:12
                9The Complexity of Satisfiability of Small Depth Circuits Chris Calabro, Russell Impagliazzo? , and Ramamohan Paturi?? Department of Computer Science and Engineering University of California, San Diego La Jolla, CA 92093-

                The Complexity of Satisfiability of Small Depth Circuits Chris Calabro, Russell Impagliazzo? , and Ramamohan Paturi?? Department of Computer Science and Engineering University of California, San Diego La Jolla, CA 92093-

                Add to Reading List

                Source URL: cseweb.ucsd.edu

                Language: English - Date: 2013-09-30 23:03:35
                  100-1 Integer Linear Programming with a Linear Number of Constraints Russell Impagliazzo ∗

                  0-1 Integer Linear Programming with a Linear Number of Constraints Russell Impagliazzo ∗

                  Add to Reading List

                  Source URL: cseweb.ucsd.edu

                  Language: English - Date: 2013-12-21 13:07:53