Avi Wigderson

Results: 21



#Item
1ON INTERACTIVE PROOFS WITH A LACONIC PROVER Oded Goldreich, Salil Vadhan, and Avi Wigderson Abstract. We continue the investigation of interactive proofs with bounded communication, as initiated by Goldreich and Hastad

ON INTERACTIVE PROOFS WITH A LACONIC PROVER Oded Goldreich, Salil Vadhan, and Avi Wigderson Abstract. We continue the investigation of interactive proofs with bounded communication, as initiated by Goldreich and Hastad

Add to Reading List

Source URL: www.math.ias.edu

Language: English - Date: 2003-06-27 08:43:01
2P=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
    3The Theory of Computing: A S
ienti
 Perspe
tive Oded Goldrei
h   Avi Wigderson

    The Theory of Computing: A S ienti Perspe tive Oded Goldrei h  Avi Wigderson

    Add to Reading List

    Source URL: www.wisdom.weizmann.ac.il

    Language: English - Date: 2009-08-13 03:08:15
      4On the interaction of TCS and Math∗ Avi Wigderson June 29, 2016 1

      On the interaction of TCS and Math∗ Avi Wigderson June 29, 2016 1

      Add to Reading List

      Source URL: thmatters.files.wordpress.com

      - Date: 2016-07-04 21:07:05
        5P, N P and mathematics – a computational complexity perspective Avi Wigderson December 21, 2006 “P versus N P – a gift to mathematics from computer science” Steve Smale

        P, N P and mathematics – a computational complexity perspective Avi Wigderson December 21, 2006 “P versus N P – a gift to mathematics from computer science” Steve Smale

        Add to Reading List

        Source URL: www.math.ias.edu

        Language: English - Date: 2006-12-21 14:04:22
          6Extracting Randomness via Repeated Condensing∗ Omer Reingold† Ronen Shaltiel‡  Avi Wigderson§

          Extracting Randomness via Repeated Condensing∗ Omer Reingold† Ronen Shaltiel‡ Avi Wigderson§

          Add to Reading List

          Source URL: omereingold.files.wordpress.com

          Language: English - Date: 2014-10-21 19:38:31
            7COMPUTATIONAL INTRACTABILITY AND PSEUDORANDOMNESS    The areas of computational intractability and pseudorandomness (see article by Avi Wigderson, Herbert H. Maass Professor, page 1) have been among the most exciting sc

            COMPUTATIONAL INTRACTABILITY AND PSEUDORANDOMNESS   The areas of computational intractability and pseudorandomness (see article by Avi Wigderson, Herbert H. Maass Professor, page 1) have been among the most exciting sc

            Add to Reading List

            Source URL: www.math.ias.edu

            Language: English - Date: 2010-04-09 09:12:37
              8Public-Key Cryptography from Different Assumptions Benny Applebaum∗ Boaz Barak†  Avi Wigderson‡

              Public-Key Cryptography from Different Assumptions Benny Applebaum∗ Boaz Barak† Avi Wigderson‡

              Add to Reading List

              Source URL: www.eng.tau.ac.il

              Language: English - Date: 2010-10-14 04:05:39
                9Boaz Barak – Curriculum Vitae MarchPersonal Details

                Boaz Barak – Curriculum Vitae MarchPersonal Details

                Add to Reading List

                Source URL: www.boazbarak.org

                Language: English - Date: 2015-03-30 12:59:24
                10Public-Key Cryptography from Different Assumptions Benny Applebaum∗ Boaz Barak†  Avi Wigderson‡

                Public-Key Cryptography from Different Assumptions Benny Applebaum∗ Boaz Barak† Avi Wigderson‡

                Add to Reading List

                Source URL: www.boazbarak.org

                Language: English - Date: 2011-10-10 23:51:30