Boolean

Results: 2137



#Item
21Boolean function analysis on high-dimensional expanders Irit Dinur∗ Yuval Filmus† Prahladh Harsha‡

Boolean function analysis on high-dimensional expanders Irit Dinur∗ Yuval Filmus† Prahladh Harsha‡

Add to Reading List

Source URL: www.cs.toronto.edu

Language: English - Date: 2018-04-21 15:28:51
    22Rewriting Models of Boolean Programs Javier Esparza University of Stuttgart Joint work with Ahmed Bouajjani

    Rewriting Models of Boolean Programs Javier Esparza University of Stuttgart Joint work with Ahmed Bouajjani

    Add to Reading List

    Source URL: www7.in.tum.de

    Language: English - Date: 2007-05-25 06:28:11
      23A Hierarchical Approach to Learning the Boolean Multiplexer Function John R. Koza Computer Science Department Stanford University Stanford, CAUSA

      A Hierarchical Approach to Learning the Boolean Multiplexer Function John R. Koza Computer Science Department Stanford University Stanford, CAUSA

      Add to Reading List

      Source URL: www.genetic-programming.com

      Language: English - Date: 2006-11-17 21:17:23
        24Within the input boxes you can also use search expressions created with any Boolean operator(s) and brackets (see paragraph

        Within the input boxes you can also use search expressions created with any Boolean operator(s) and brackets (see paragraph "Basic search"). sources: specialized encyclopaedias and dictionaries; handbooks and textbooks;

        Add to Reading List

        Source URL: www.ub.ruhr-uni-bochum.de

        Language: English - Date: 2016-01-15 07:18:42
          25BATBAMBAMMBA: Boolean and Arithmetic Languages Oregon Programming Languages Summer School Ronald Garcia 4 July

          BATBAMBAMMBA: Boolean and Arithmetic Languages Oregon Programming Languages Summer School Ronald Garcia 4 July

          Add to Reading List

          Source URL: www.cs.uoregon.edu

          Language: English - Date: 2017-07-05 13:09:34
            26Visualising the Boolean Algebra IB4 in 3D Hans Smessaert & Lorenz Demey KU Leuven, Belgium Rhombic Dodecahedron (RDH) LOGICAL GEOMETRY

            Visualising the Boolean Algebra IB4 in 3D Hans Smessaert & Lorenz Demey KU Leuven, Belgium Rhombic Dodecahedron (RDH) LOGICAL GEOMETRY

            Add to Reading List

            Source URL: www.logicalgeometry.org

            Language: English - Date: 2017-09-11 05:03:12
              27MATHEMATICS COMPUTER AIDED INVESTIGATIONS OF RELATION ALGEBRAS PETER JIPSEN Dissertation under the direction of Professor Bjarni J´onsson This dissertation is a self-contained study of Boolean algebras with a residuated

              MATHEMATICS COMPUTER AIDED INVESTIGATIONS OF RELATION ALGEBRAS PETER JIPSEN Dissertation under the direction of Professor Bjarni J´onsson This dissertation is a self-contained study of Boolean algebras with a residuated

              Add to Reading List

              Source URL: www1.chapman.edu

              Language: English - Date: 2003-06-23 03:25:32
                281 Overview • This talk is about: – The Boolean Satisfiability Problem (SAT) – The Constraint Satisfaction Problem (CSP)

                1 Overview • This talk is about: – The Boolean Satisfiability Problem (SAT) – The Constraint Satisfaction Problem (CSP)

                Add to Reading List

                Source URL: algo2017.ac.tuwien.ac.at

                Language: English - Date: 2017-09-05 11:46:56
                  29GeStoDifferent: a Cytoscape plugin for the identification of Boolean gene regulatory networks describing the stochastic differentiation process Reference manual for version 1.0 Giulio Caravagna

                  GeStoDifferent: a Cytoscape plugin for the identification of Boolean gene regulatory networks describing the stochastic differentiation process Reference manual for version 1.0 Giulio Caravagna

                  Add to Reading List

                  Source URL: bimib.disco.unimib.it

                  Language: English - Date: 2012-10-31 07:04:44
                    30Ng Kong Beng Public Lecture Series 黄光明公开讲座 For the past 40 years computer scientists generally believed that NP-complete problems are intractable. In particular, Boolean satisfiability (SAT), as a paradigma

                    Ng Kong Beng Public Lecture Series 黄光明公开讲座 For the past 40 years computer scientists generally believed that NP-complete problems are intractable. In particular, Boolean satisfiability (SAT), as a paradigma

                    Add to Reading List

                    Source URL: www2.ims.nus.edu.sg

                    Language: English - Date: 2017-10-25 03:25:49