minisat

Fast and lightweight SAT solver

Despite the NP completeness of the satisfiability problem of Boolean formulas (SAT), SAT solvers are often able to decide this problem in a reasonable time frame. As all other NP complete problems are reducible to SAT, the solvers have become a general purpose tool for this class of problems.

firefox-locale-ku

Transitional package for unavailable language

mrbayes-dbg

Bayesian Inference of Phylogeny - debug symbols

mediawiki-math

math rendering plugin for MediaWiki (transitional package)

python-pylast

Python interface to Last.fm and other compatible services

Last.fm is a service providing a way to keep a record of what the users listen to and offering music recommendations based on that record.

cryptsetup-run

transitional dummy package for cryptsetup

This is a transitional dummy package to get upgrading systems to install the cryptsetup package. It can safely be removed once no other package depends on it.