Complexity

Results: 8084



#Item
301

Communication Complexity (for Algorithm Designers) Tim Roughgarden c Tim Roughgarden 2015

Add to Reading List

Source URL: theory.stanford.edu

- Date: 2016-04-25 23:25:10
    302

    FAST LINEAR HOMOTOPY TO FIND APPROXIMATE ZEROS OF POLYNOMIAL SYSTEMS ´ AND LUIS MIGUEL PARDO CARLOS BELTRAN Abstract. We prove a new complexity bound, polynomial on the average,

    Add to Reading List

    Source URL: personales.unican.es

    - Date: 2011-06-09 07:24:52
      303

      Symposium on Theoretical Aspects of Computer ScienceBordeaux), ppwww.stacs-conf.org COMPLEXITY OF SOLUTIONS OF EQUATIONS OVER SETS OF NATURAL NUMBERS ARTUR JEZ˙

      Add to Reading List

      Source URL: drops.dagstuhl.de

      - Date: 2008-02-05 06:44:00
        304

        Towards Assessing the Complexity of Object Migration in Dynamic, Feature-oriented Software Product Lines (Note the corrigenda to Sections 4.3 and 7 as well as to Figure 4 marked by change bars, contributed in August 2014

        Add to Reading List

        Source URL: nm.wu-wien.ac.at

        - Date: 2014-08-12 10:26:10
          305

          On the complexity of membership and counting in height-deterministic pushdown automata Nutan Limaye1 , Meena Mahajan1 , and Antoine Meyer2 1 2

          Add to Reading List

          Source URL: www.imsc.res.in

          - Date: 2008-02-29 07:33:09
            306

            LINEAR CHAOS? Nathan S. Feldman In this article we hope to convience the reader that the dynamics of linear operators can be fantastically complex and that linear dynamics exhibits the same beauty and complexity as non-l

            Add to Reading List

            Source URL: home.wlu.edu

            - Date: 2001-11-07 09:35:36
              307

              Performance Effects of Architectural Complexity in the Intel 432 ROBERT P. COLWELL Multiflow Computer, Inc. EDWARD F. GEHRINGER North Carolina State University

              Add to Reading List

              Source URL: us-east.manta.joyent.com

              - Date: 2013-08-15 02:19:57
                308

                Affine Functional Programs as Higher-order Boolean Circuits Damiano Mazza∗ CNRS, LIPN, Universit´e Paris 13, Sorbonne Paris Cit´e Implicit computational complexity. Loosely speakin

                Add to Reading List

                Source URL: conf.researchr.org

                  309

                  Aachen Department of Computer Science Technical Report A Dependency Pair Framework for Innermost Complexity Analysis of

                  Add to Reading List

                  Source URL: sunsite.informatik.rwth-aachen.de

                  - Date: 2011-04-22 18:07:53
                    310

                    Topics in Circuit Complexity (CS354, Fall’11) Week 1: An Overview of Circuit Complexity Lecture Notes for 9/27 and 9/29

                    Add to Reading List

                    Source URL: web.stanford.edu

                    - Date: 2011-10-07 14:47:09
                      UPDATE