_            _    _        _         _
      /\ \         /\ \ /\ \     /\_\      / /\
      \_\ \       /  \ \\ \ \   / / /     / /  \
      /\__ \     / /\ \ \\ \ \_/ / /     / / /\ \__
     / /_ \ \   / / /\ \ \\ \___/ /     / / /\ \___\
    / / /\ \ \ / / /  \ \_\\ \ \_/      \ \ \ \/___/
   / / /  \/_// / /   / / / \ \ \        \ \ \
  / / /      / / /   / / /   \ \ \   _    \ \ \
 / / /      / / /___/ / /     \ \ \ /_/\__/ / /
/_/ /      / / /____\/ /       \ \_\\ \/___/ /
\_\/       \/_________/         \/_/ \_____\/
brial 1.2.14
Dependencies: boost@1.83.0 libpng@1.6.39 m4ri@20250128
Channel: guix
Location: gnu/packages/sagemath.scm (gnu packages sagemath)
Home page: https://github.com/BRiAl/BRiAl/
Licenses: GPL 2+
Synopsis: Arithmetic of polynomials over boolean rings
Description:

BRiAl is the successor to PolyBoRi maintained by the Sage community. Its core is a C++ library, which provides high-level data types for Boolean polynomials and monomials, exponent vectors, as well as for the underlying polynomial rings and subsets of the powerset of the Boolean variables. As a unique approach, binary decision diagrams are used as internal storage type for polynomial structures.

Total results: 1