• LattE

  • Referenced in 122 articles [sw04654]
  • computer software dedicated to the problems of counting lattice points and integration inside convex polytopes...
  • insulate

  • Referenced in 24 articles [sw21729]
  • proposed approaches to this problem so far require finding and counting real roots of polynomials ... this real root finding and counting problem have been developed, but they tend ... always correct and that avoids finding and counting real roots of polynomials with non-rational...
  • PHCpack

  • Referenced in 236 articles [sw00705]
  • package features a great variety of root-counting methods among its tools. The outline ... performance on a large database of test problems. The software has been developed on four...
  • PSP

  • Referenced in 34 articles [sw07589]
  • solvers for the auxiliary problems, and competitive runtimes and iteration counts are reported for high...
  • clique

  • Referenced in 34 articles [sw07590]
  • solvers for the auxiliary problems, and competitive runtimes and iteration counts are reported for high...
  • DOULION

  • Referenced in 12 articles [sw30192]
  • coin. Counting the number of triangles in a graph is a beautiful algorithmic problem which ... ratio involve the execution of a triangle counting algorithm. Furthermore, several interesting graph mining applications ... this paper, we focus on the problem of counting triangles in a graph. We propose...
  • ROTA

  • Referenced in 18 articles [sw11577]
  • generating functions for many difficult problems dealing with counting combinatorial objects...
  • Regexpcount

  • Referenced in 6 articles [sw00792]
  • Regexpcount, a symbolic package for counting problems on regular expressions and words. In a previous ... purposes: to determine the statistics of simultaneous counting of different motifs, and to compute ... example corresponding to a practical biological problem: getting the statistics for the number of matches...
  • azove

  • Referenced in 13 articles [sw04634]
  • structure of these problems raises the following tasks: count or enumerate the feasible solutions ... algorithm is capable of solving knapsack problems, subset sum problems and multidimensional knapsack problems ... optimal variable ordering is an NP-hard problem. We derive a $0/1$ IP for finding ... azove 1.1 which is a tool for counting and enumerating $0/1$ points. Computational results...
  • PISA

  • Referenced in 1 article [sw20692]
  • effects of actions. We show that the problem of assessing the quality of a plan ... equivalence with the weighted model counting problems. We present two approaches to synthesizing robust plans...
  • Sage S-box MILP toolkit

  • Referenced in 2 articles [sw24163]
  • MILP toolkit: Extension of the Toolkit for Counting Active S-boxes using Mixed-Integer Linear ... generates a Mixed-Integer Linear Programming problem which counts the minimum number of (linearly...
  • SchurRAS

  • Referenced in 7 articles [sw07241]
  • some numerical experiments with a model problem, the convergence rate of the method was found ... iteration count and CPU time. For a few two-dimensional scaled problems, SchurRAS was about...
  • SNVMix

  • Referenced in 4 articles [sw29569]
  • tumors to address this problem. The first models allelic counts as observations and infers SNVs...
  • FaCSI

  • Referenced in 18 articles [sw18530]
  • benchmark cylindrical geometry and on a problem of physiological interest, namely the blood flow through ... linear solver iterations on the cores count (scalability of the preconditioner) and on the mesh...
  • RankAggreg

  • Referenced in 9 articles [sw07957]
  • ranks using several different algorithms: Borda count, Cross-Entropy Monte Carlo algorithm, Genetic algorithm ... brute force algorithm (for small problems...
  • P123

  • Referenced in 4 articles [sw19252]
  • most challenging problems in enumerative combinatorics is to count Wilf classes, where you are given...
  • P1234

  • Referenced in 4 articles [sw19255]
  • most challenging problems in enumerative combinatorics is to count Wilf classes, where you are given...
  • P12345

  • Referenced in 4 articles [sw19256]
  • most challenging problems in enumerative combinatorics is to count Wilf classes, where you are given...
  • P123456

  • Referenced in 4 articles [sw19257]
  • most challenging problems in enumerative combinatorics is to count Wilf classes, where you are given...
  • F1234

  • Referenced in 4 articles [sw19254]
  • most challenging problems in enumerative combinatorics is to count Wilf classes, where you are given...