Complexity

Results: 8084



#Item
41Parikh Equivalence and Descriptional Complexity Giovanni Pighizzini Dipartimento di Informatica Università degli Studi di Milano, Italy

Parikh Equivalence and Descriptional Complexity Giovanni Pighizzini Dipartimento di Informatica Università degli Studi di Milano, Italy

Add to Reading List

Source URL: pighizzini.di.unimi.it

Language: English - Date: 2014-01-24 13:45:48
    42CS 151  Complexity Theory Spring 2017

    CS 151 Complexity Theory Spring 2017

    Add to Reading List

    Source URL: users.cms.caltech.edu

    Language: English - Date: 2017-04-07 17:13:28
      43ECE 901 Lecture 14: Maximum Likelihood Estimation and Complexity Regularization R. Nowak

      ECE 901 Lecture 14: Maximum Likelihood Estimation and Complexity Regularization R. Nowak

      Add to Reading List

      Source URL: nowak.ece.wisc.edu

      Language: English - Date: 2012-03-09 07:34:15
        44The problem of biology is not to stand aghast at the complexity but to conquer it. Sydney Brenner. Abstract Machines of Systems Biology Luca Cardelli

        The problem of biology is not to stand aghast at the complexity but to conquer it. Sydney Brenner. Abstract Machines of Systems Biology Luca Cardelli

        Add to Reading List

        Source URL: lucacardelli.name

        Language: English - Date: 2009-03-14 15:24:36
          45Parikh’s Theorem and Descriptional Complexity Giovanna J. Lavado and Giovanni Pighizzini Dipartimento di Informatica e Comunicazione Università degli Studi di Milano  SOFSEM 2012

          Parikh’s Theorem and Descriptional Complexity Giovanna J. Lavado and Giovanni Pighizzini Dipartimento di Informatica e Comunicazione Università degli Studi di Milano SOFSEM 2012

          Add to Reading List

          Source URL: pighizzini.di.unimi.it

          Language: English - Date: 2012-01-23 08:12:13
            46

            Structural complexity effects on the initial similarity in resident prey survival among natural and created intertidal oyster reefs Walters, K.*​,1; Martin, C. W.​2 1 D​epartment of Marine Science, Coastal Carolin

            Add to Reading List

            Source URL: www.bemsociety.org

            Language: English - Date: 2017-01-06 15:04:18
              47On the complexity of some computational problems in the Turing model Claus Diem November 18, 2013 Abstract Algorithms for concrete problems are usually described and analyzed in some random access machine model. This is

              On the complexity of some computational problems in the Turing model Claus Diem November 18, 2013 Abstract Algorithms for concrete problems are usually described and analyzed in some random access machine model. This is

              Add to Reading List

              Source URL: www.mathematik.uni-leipzig.de

              Language: English - Date: 2013-11-18 06:32:25
                48Information Complexity of Black-Box Convex Optimization: A New Look Via Feedback Information Theory

                Information Complexity of Black-Box Convex Optimization: A New Look Via Feedback Information Theory

                Add to Reading List

                Source URL: maxim.ece.illinois.edu

                Language: English - Date: 2012-04-18 12:07:58
                  49Lower Bounds on Quantum Query Complexity Peter Høyer∗  † ˇ

                  Lower Bounds on Quantum Query Complexity Peter Høyer∗ † ˇ

                  Add to Reading List

                  Source URL: www.ucw.cz

                  Language: English - Date: 2006-10-04 14:43:01
                    50Linguist and Philos:215–250 DOIs10988z RESEARCH ARTICLE Computational complexity of polyadic lifts of generalized quantifiers in natural language

                    Linguist and Philos:215–250 DOIs10988z RESEARCH ARTICLE Computational complexity of polyadic lifts of generalized quantifiers in natural language

                    Add to Reading List

                    Source URL: jakubszymanik.com

                    Language: English - Date: 2011-11-28 07:51:42