Computational complexity

Results: 2253



#Item
1Sharp Bounds on Davenport-Schinzel Sequences of Every Order SETH PETTIE, University of Michigan One of the longest-standing open problems in computational geometry is bounding the complexity of the lower envelope of n un

Sharp Bounds on Davenport-Schinzel Sequences of Every Order SETH PETTIE, University of Michigan One of the longest-standing open problems in computational geometry is bounding the complexity of the lower envelope of n un

Add to Reading List

Source URL: web.eecs.umich.edu

Language: English
    2Optimization of Quadratic Forms and t-norm Forms on Interval Domain and Computational Complexity Milan Hlad´ık ˇ y Michal Cern´

    Optimization of Quadratic Forms and t-norm Forms on Interval Domain and Computational Complexity Milan Hlad´ık ˇ y Michal Cern´

    Add to Reading List

    Source URL: www.cs.utep.edu

    Language: English - Date: 2018-02-17 12:27:45
      3On 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
        4Linguist 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
          5Appeared in SIAM Journal on Computing 27(4):, August Computational Complexity and Knowledge

          Appeared in SIAM Journal on Computing 27(4):, August Computational Complexity and Knowledge

          Add to Reading List

          Source URL: web.cs.ucla.edu

          Language: English - Date: 2003-09-23 18:57:54
            6Notes on Computational Complexity Theory CPSC: Spring 2017 James Aspnes:25

            Notes on Computational Complexity Theory CPSC: Spring 2017 James Aspnes:25

            Add to Reading List

            Source URL: cs.yale.edu

            Language: English - Date: 2018-02-16 14:25:41
              7Extensive Form Correlated Equilibrium: Definition and Computational Complexity Bernhard von Stengel Department of Mathematics, London School of Economics, Houghton St, London WC2A 2AE, United Kingdom email: stengel@maths

              Extensive Form Correlated Equilibrium: Definition and Computational Complexity Bernhard von Stengel Department of Mathematics, London School of Economics, Houghton St, London WC2A 2AE, United Kingdom email: stengel@maths

              Add to Reading List

              Source URL: www.cdam.lse.ac.uk

              Language: English - Date: 2017-04-12 10:30:40
                8On the notion of bit complexity Claus Diem August 21, 2010 Abstract In many works in the fields of computational complexity, algorithmic number theory and mathematical cryptology as well as in related areas, claims on th

                On the notion of bit complexity Claus Diem August 21, 2010 Abstract In many works in the fields of computational complexity, algorithmic number theory and mathematical cryptology as well as in related areas, claims on th

                Add to Reading List

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

                Language: English - Date: 2010-08-21 13:57:07
                  9Madhu Sudan Gordon McKay Professor, John A. Paulson School of Engineering and Applied Sciences, Harvard University Areas of Special Interests Theory of Computing, Algorithms, Computational Complexity, Reliable Communicat

                  Madhu Sudan Gordon McKay Professor, John A. Paulson School of Engineering and Applied Sciences, Harvard University Areas of Special Interests Theory of Computing, Algorithms, Computational Complexity, Reliable Communicat

                  Add to Reading List

                  Source URL: madhu.seas.harvard.edu

                  Language: English - Date: 2015-09-22 20:56:09
                    101 1 Computational Complexity of Graphs Stasys Jukna1

                    1 1 Computational Complexity of Graphs Stasys Jukna1

                    Add to Reading List

                    Source URL: lovelace.thi.informatik.uni-frankfurt.de

                    Language: English - Date: 2015-10-27 15:13:47