Complexity

Results: 8084



#Item
281

The Parallel Complexity of Coloring Games Guillaume Ducoffe To cite this version: Guillaume Ducoffe. The Parallel Complexity of Coloring Games. Martin Gairing and Rahul Savani. 9th International Symposium, SAGT 2016, Sep

Add to Reading List

Source URL: hal.archives-ouvertes.fr

- Date: 2016-12-21 07:33:13
    282

    The Complexity of Probabilistic EL V´ıctor Guti´errez Basulto1 , Jean Christoph Jung1 , Carsten Lutz1 , and Lutz Schr¨oder1,2 1 University Bremen, Germany, {victor,jeanjung,clu}@informatik.uni-bremen.de 2

    Add to Reading List

    Source URL: ceur-ws.org

    - Date: 2011-06-26 10:20:37
      283

      Sponsored by: SD-WAN for Addressing Branch Network Complexity & Security A Global Survey of Network Professionals November 2016

      Add to Reading List

      Source URL: av1uq17c9f833ixqs27m4zxc.wpengine.netdna-cdn.com

      - Date: 2016-12-07 17:27:52
        284

        Problem Solution Sustenance in XCS: Markov Chain Analysis of Niche Support Distributions and the Impact on Computational Complexity Martin V. Butz⋆ , David E. Goldberg‡ , Pier Luca Lanzi† , Kumara Sastry‡ ⋆

        Add to Reading List

        Source URL: www.mindraces.org

        - Date: 2007-04-23 06:20:15
          285

          Complexity Winter School Marseille - January 30 - FebruaryMonday January 30 10h45 : Opening. 11h-12h30 : Yiannis N. Moschovakis - Relative complexity in arithmetic and algebra.

          Add to Reading List

          Source URL: perso.ens-lyon.fr

          - Date: 2012-01-11 16:21:47
            286

            Time Complexity Analysis of the Stochastic Diffusion Search † Slawomir J.Nasuto, ‡Mark J.Bishop and $Stanislao Lauria Department of Cybernetics, Neural Networks Research Group,

            Add to Reading List

            Source URL: www.doc.gold.ac.uk

            - Date: 2006-02-21 15:49:43
              287

              Proc. 23rd Int. Workshop on Description Logics (DL2010), CEUR-WS 573, Waterloo, Canada, Complexity of Axiom Pinpointing in the DL-Lite Family Rafael Pe˜ naloza1 and Barı¸s Sertkaya2

              Add to Reading List

              Source URL: ceur-ws.org

              - Date: 2010-04-20 14:40:19
                288

                12345efghi UNIVERSITY OF WALES SWANSEA REPORT SERIES PCC 2007 Proof, Computation, Complexity

                Add to Reading List

                Source URL: www-compsci.swan.ac.uk

                - Date: 2007-04-16 08:36:58
                  289

                  Iterative Low Complexity Factorization for Projective Reconstruction Hanno Ackermann and Kenichi Kanatani Department of Computer Science Okayama University, Okayama, Japan {hanno,kanatani}@suri.it.okayama-u.ac.j

                  Add to Reading List

                  Source URL: www.suri.cs.okayama-u.ac.jp

                  - Date: 2008-02-26 00:12:06
                    290

                    Non-Uniform Data Complexity of Query Answering in Description Logics Carsten Lutz1 and Frank Wolter2 1 Department of Computer Science, University of Bremen, Germany

                    Add to Reading List

                    Source URL: ceur-ws.org

                    - Date: 2011-06-26 10:23:02
                      UPDATE