fes
Fast Exhaustive Search
This external library implements an efficient implement of exhaustive search to solve systems of low-degree boolean equations. Exhaustive search is asymptotically faster than computing a Groebner basis, except in special cases. This particular implementation is particularly efficient (in the good cases it tests 3 candidate solutions per CPU cycle on each core).
Releases Overview
| Release | Stable | Testing |
|---|---|---|
| Fedora Rawhide | 0.2-13.fc41 | - |
| Fedora 41 | 0.2-13.fc41 | - |
| Fedora 40 | 0.2-12.fc40 | - |
| Fedora 39 | 0.2-10.fc39 | - |
File a new bug report »
Package Info
Related Packages
Package Info
- Upstream: https://www-almasty.lip6.fr/~bouillaguet/implementation.html
- License(s): GPL-2.0-or-later
- Maintainer: pcpa
Related Packages
You can contact the maintainers of this package via email at
fes dash maintainers at fedoraproject dot org.
Sources on Pagure