• Z-Tree

  • Referenced in 353 articles [sw11707]
  • representation, allowing the simple programming of normal form games, extensive form games, double auctions...
  • MATCONT

  • Referenced in 205 articles [sw00551]
  • interactive environment for the continuation and normal form analysis of dynamical systems ... extended systems, and the computation of normal form coefficients for bifurcations of limit cycles...
  • Walksat

  • Referenced in 193 articles [sw04328]
  • have been converted into, conjunctive normal form. They start by assigning a random value...
  • VAMPIRE

  • Referenced in 178 articles [sw02918]
  • system works only with clausal normal forms, the shell accepts a problem in the full...
  • JBool

  • Referenced in 65 articles [sw06185]
  • Boolean Functions defined either by conjonctive normal forms (clausal) or by disjonctive ones. Boolean Functions...
  • Homology

  • Referenced in 23 articles [sw04871]
  • simplicial homology based on efficient Smith normal form algorithms Geometric properties of topological spaces ... calculation of the Smith Normal Form of the boundary matrices which, in general, are sparse ... calculation of the Smith Normal Form of sparse matrices and compare their running times...
  • UnitWalk

  • Referenced in 33 articles [sw00993]
  • problem for Boolean formulas in conjunctive normal form. Despite its simplicity, this algorithm performs well...
  • PROC NLMIXED

  • Referenced in 30 articles [sw11039]
  • random effects) having either a standard form (normal, binomial, Poisson) or a general distribution that...
  • Janet

  • Referenced in 27 articles [sw07776]
  • implemented to compute the Jacobson normal form of a matrix with entries in this Weyl...
  • classifyCeq.lib

  • Referenced in 26 articles [sw11249]
  • certain invariants without computing the normal form. We also give a description of the algorithms...
  • DepQBF

  • Referenced in 22 articles [sw09734]
  • boolean formulae (QBF) in prenex conjunctive normal form. It is based on the DPLL algorithm...
  • Coxeter

  • Referenced in 18 articles [sw07827]
  • following : Reduced expression and normal form computations; Bruhat ordering; Ordinary Kazhdan-Lusztig polynomials; Kazhdan-Lusztig...
  • PrecoSAT

  • Referenced in 16 articles [sw07832]
  • propositional formula in conjunctive normal form (CNF). The Handbook of Satisfiability gives an excellent overview...
  • Nenofex

  • Referenced in 14 articles [sw09579]
  • quantified boolean formulae (QBF) in negation normal form (NNF), which relies on expansion...
  • DDebugger

  • Referenced in 14 articles [sw09904]
  • calculus to infer reductions, sort inferences, normal forms, and least sorts with the equational subset...
  • Autowrite

  • Referenced in 8 articles [sw01282]
  • systems (TRSs) every term not in normal form contains a needed redex (i.e., a redex ... needed redexes results in a normal form if it exists. However, neededness is in general...
  • EDIM

  • Referenced in 7 articles [sw08560]
  • diagonal entries of the Smith normal form). The programs are developed and already successfully used ... determinant) and implementations of some normal form algorithms described by Havas, Majewski, Matthews, Sterling (using...
  • LFLC 2000

  • Referenced in 10 articles [sw08217]
  • representation of fuzzy logic functions by normal forms...
  • GP-COACH

  • Referenced in 9 articles [sw09137]
  • dimensional problems. GP-COACH learns disjunctive normal form rules (generated by means of a context...
  • CirCUs

  • Referenced in 9 articles [sw00128]
  • Inverter-Graph (AIG), Conjunctive Normal Form (CNF) clauses, and Binary Decision Diagrams (BDDs). We show...