Lance Fortnow

Results: 27



#Item
1Infeasibility of Instance Compression and Succinct PCPs for NP∗ Lance Fortnow Rahul Santhanam March 19, 2010

Infeasibility of Instance Compression and Succinct PCPs for NP∗ Lance Fortnow Rahul Santhanam March 19, 2010

Add to Reading List

Source URL: people.cs.uchicago.edu

- Date: 2010-05-13 09:39:01
    2On the Complexity of Succinct Zero-Sum Games Lance Fortnow∗ Department of Computer Science University of Chicago Chicago, IL USA

    On the Complexity of Succinct Zero-Sum Games Lance Fortnow∗ Department of Computer Science University of Chicago Chicago, IL USA

    Add to Reading List

    Source URL: users.cms.caltech.edu

    - Date: 2005-06-21 20:41:38
      3Randomization, random walks, derandomization, expansion April 12, L´ aszl´ o Babai. Monte Carlo algorithms in graph isomorphism testing.

      Randomization, random walks, derandomization, expansion April 12, L´ aszl´ o Babai. Monte Carlo algorithms in graph isomorphism testing.

      Add to Reading List

      Source URL: people.cs.uchicago.edu

      Language: English - Date: 2014-04-12 08:04:57
      4Computation in a Distributed Information Market Joan Feigenbaum Lance Fortnow David Pennock

      Computation in a Distributed Information Market Joan Feigenbaum Lance Fortnow David Pennock

      Add to Reading List

      Source URL: cs-www.cs.yale.edu

      Language: English - Date: 2003-06-14 11:28:13
      5Interactive proofs April 12, L´ aszl´ o Babai. Trading group theory for randomness. In Proc. 17th STOC, pages 421–429. ACM Press, 1985. doi:22192.

      Interactive proofs April 12, L´ aszl´ o Babai. Trading group theory for randomness. In Proc. 17th STOC, pages 421–429. ACM Press, 1985. doi:22192.

      Add to Reading List

      Source URL: people.cs.uchicago.edu

      Language: English - Date: 2014-04-12 05:40:19
      6Diagonalization Lan e Fortnow y NEC Resear h Institute

      Diagonalization Lan e Fortnow y NEC Resear h Institute

      Add to Reading List

      Source URL: lance.fortnow.com

      Language: English - Date: 2016-02-15 15:45:38
        7Infinitely-Often Autoreducible Sets Richard Beigel∗, Temple University Lance Fortnow†, University of Chicago Frank Stephan‡, National University of Singapore

        Infinitely-Often Autoreducible Sets Richard Beigel∗, Temple University Lance Fortnow†, University of Chicago Frank Stephan‡, National University of Singapore

        Add to Reading List

        Source URL: people.cs.uchicago.edu

        Language: English - Date: 2010-05-13 09:39:02
          8TM Piccadilly Software Presents

          TM Piccadilly Software Presents

          Add to Reading List

          Source URL: lance.fortnow.com

          Language: English - Date: 2015-09-01 10:59:17
            9Betting Boolean-Style: A Framework for Trading in Securities Based on Logical Formulas Lance Fortnow 1 Department of Computer Science, University of Chicago, 1100 E. 58th St., Chicago, IL 60637

            Betting Boolean-Style: A Framework for Trading in Securities Based on Logical Formulas Lance Fortnow 1 Department of Computer Science, University of Chicago, 1100 E. 58th St., Chicago, IL 60637

            Add to Reading List

            Source URL: dpennock.com

              10Combinatorial Betting YILING CHEN Yahoo! Research LANCE FORTNOW University of Chicago EVDOKIA NIKOLOVA

              Combinatorial Betting YILING CHEN Yahoo! Research LANCE FORTNOW University of Chicago EVDOKIA NIKOLOVA

              Add to Reading List

              Source URL: www.sigecom.org

              Language: English - Date: 2007-12-23 21:18:25