jjames
Packages
435 Packages
rpms/4ti2
The 4ti2 rpms
rpms/abc
The abc rpms
rpms/alt-ergo
The alt-ergo rpms
rpms/antic
The antic package
rpms/antlr3
The antlr3 rpms
rpms/antlr4-project
The antlr4-project package
rpms/apache-commons-configuration
The apache-commons-configuration rpms
rpms/apache-commons-jexl
The apache-commons-jexl rpms
rpms/apache-commons-vfs
The apache-commons-vfs rpms
rpms/apron
The apron rpms
rpms/arb
The arb rpms
rpms/argparse
[Argparse](https://github.com/p-ranav/argparse) is an argument parser for
C++17 in a single header file.
rpms/asl
The asl rpms
rpms/autolink-java
[Autolink](https://github.com/robinst/autolink-java) is a Java library to
extract links such as URLs and email addresses from plain text. It's smart
about where a link ends, such as with trailing punctuation.
rpms/azove
The azove rpms
rpms/bigloo
The bigloo rpms
rpms/bliss
The bliss rpms
rpms/breakid
[BreakID](https://github.com/meelgroup/breakid) is a symmetry detecting and
breaking library for SAT solvers. It is based on Jo Devriendt's
[BreakID code](https://bitbucket.org/krr/breakid/src/master/). It has been
re-licensed by the original author to be MIT. All modifications by Mate Soos.
rpms/cadical
The cadical package
rpms/carat
The carat rpms
rpms/ccluster
[Ccluster](https://github.com/rimbach/Ccluster) is a C library implementing an
algorithm for local clustering of the complex roots of a univariate polynomial
whose coefficients are complex numbers.
The inputs of the clustering algorithm are a polynomial P, a square complex
box B and a rational number eps.
It outputs a set of eps-natural clusters of roots together with the sum of
multiplicities of the roots in each cluster. An eps-cluster is a complex disc
D of radius at most eps containing at least one root, and it is natural when
3D contains the same roots as D. Each root of P in B is in exactly one
cluster of the output, and clusters may contain roots of P in 2B.
The implemented algorithm is described
[here](https://dl.acm.org/citation.cfm?id=2930939).
Please cite https://link.springer.com/chapter/10.1007/978-3-319-96418-8_28
if you use it in your research.
rpms/cddlib
The cddlib rpms
rpms/check
The check rpms
rpms/cli11
The cli11 package
rpms/clisp
The clisp rpms
rpms/cocoalib
The cocoalib package
rpms/cohomCalg
The cohomCalg package
rpms/coin-or-Data-miplib3
The coin-or-Data-miplib3 package
rpms/coin-or-Data-Netlib
The coin-or-Data-Netlib package
rpms/coin-or-HiGHS
[HiGHS](https://highs.dev/) is a high performance serial and parallel solver
for large scale sparse linear optimization problems of the form
166810 \min \quad \dfrac{1}{2}x^TQx + c^Tx \qquad \textrm{s.t.}~ \quad L \leq Ax \leq U; \quad l \leq x \leq u 166810
where Q must be positive semi-definite and, if Q is zero, there may be a
requirement that some of the variables take integer values. Thus HiGHS
can solve linear programming (LP) problems, convex quadratic programming
(QP) problems, and mixed integer programming (MIP) problems. It is
mainly written in C++, but also has some C.
HiGHS has primal and dual revised simplex solvers, originally written by
Qi Huangfu and further developed by Julian Hall. It also has an
interior point solver for LP written by Lukas Schork, an active set
solver for QP written by Michael Feldmeier, and a MIP solver written by
Leona Gottwald. Other features have been added by Julian Hall and Ivet
Galabova, who manages the software engineering of HiGHS and interfaces
to C, C#, FORTRAN, Julia and Python.
Although HiGHS is freely available under the MIT license, we would be
pleased to learn about users' experience and give advice via email sent
to highsopt@gmail.com.
rpms/coin-or-lemon
A C++ template library providing many common graph algorithms
rpms/coq
The coq rpms
rpms/coxeter
The coxeter package
rpms/cr-marcstevens-snippets
The cr-marcstevens-snippets package
rpms/cryptominisat
The cryptominisat rpms
rpms/csdp
The csdp rpms
rpms/cvc4
The cvc4 rpms
rpms/cvc5
CVC5 is a tool for determining the satisfiability of a first order
formula modulo a first order theory (or a combination of such theories).
It is the fifth in the Cooperating Validity Checker family of tools
(CVC, CVC Lite, CVC3, CVC4) but does not directly incorporate code from
any previous version prior to CVC4.
CVC5 is intended to be an open and extensible SMT engine. It can be
used as a stand-alone tool or as a library. It has been designed to
increase the performance and reduce the memory overhead of its
predecessors.
rpms/cxsc
The cxsc rpms
rpms/drat2er
The drat2er package
rpms/drat-trim
The drat-trim package
rpms/DSDP
The DSDP rpms
rpms/E
The E rpms
rpms/e-antic
The e-antic package
rpms/ecl
The ecl rpms
rpms/eclib
The eclib rpms
rpms/edwin-fonts
In 1999-2000, URW++ Design and Development GmbH released Type 1
implementations of the Core 35 fonts under the GNU General Public License
(GPL) and the Aladdin Ghostscript Free Public License (AFPL). In 2009, URW++
additionally released the same fonts under the LaTeX Project Public License
(LPPL).
In 2016, URW++ released a major Version 2.0 upgrade to the Core 35 fonts.
This version is an extensive reworking of the original Core 35 fonts, with
improved font outlines, and greatly extended character sets, including
Cyrillic and Greek. Also, some font names were changed. Version 2.0 was
released in Type 1, OpenType-CFF and OpenType-TTF formats. URW++ released
Version 2.0 of the fonts under the GNU Affero General Public License, Version
3 (AGPL) with an exemption.
In 2017, URW++ additionally released the same Version 2.0 fonts under the
LaTeX Project Public License (LPPL) Version 1.3c, and under the SIL Open Font
License (OFL), Version 1.1, without a "Reserved Font Name" clause.
In 2020, MuseScore BVBA released the Edwin font family, a renamed version of
the C059 font family (Roman, Italic, Bold & Bold Italic) from the Core 35 font
set. This was done in order to make modifications that suit the requirements
of the open source notation software, MuseScore. It is released under the SIL
Open Font License (OFL) only.
rpms/emacs-auctex
The emacs-auctex rpms