-
The goal of this patch is to include breadth enumeration method for SearchForest, categorify SearchForest and make it very simple for inherit from it.
Add an example of Parent which inherit from Se…
-
**Submitting author:** @ZuzanaSebb (Zuzana Sebechlebská)
**Repository:** https://github.com/PoliUniLu/cora
**Branch with paper.md** (empty if default branch):
**Version:** 0.1.1
**Editor:** @vissario…
-
#### Description
I'm currently trying to push RIOT forward in terms of power management. Now that `ztimer` has made it into master, it's a really good basis to achieve a power management that *just…
jue89 updated
2 years ago
-
## Problem
This will be a LONG one, please read all of it! (Except parts marked "optional".)
Many learners report difficulties with certain **abstract mathematical concepts** in "Introduction to…
-
Clause keeps a "status" literal to cache whether its been satisfied or not. This makes the code harder to read, and it doesn't really provide any algorithmic benefits over using purely functional im::…
-
This ticket proposes a new implementation for punctured codes.
It contains:
- a new code class, `PuncturedCode`
- a dedicated encoder to compute the generator matrix of a Punctured Code.
- a ded…
-
--------
Under Discussion Topic
--------
** Discussion **
Plugin Entities (Entities in Plugins that are meant to be available as RAVEN Entities such as Sampler, ROMs, PostProcessors, etc) can po…
-
This patch aims to implement a class for embedded surfaces in the three dimensional euclidean space described by a parametrization. Its focus on the computation of metric invariants (first and secon…
-
I'm using #698 as a wish list of items to add to the graph theory module of Sage. The purpose of this ticket is to implement the [Bellman-Ford](http://en.wikipedia.org/wiki/Bellman%E2%80%93Ford_algo…
-
In Sage 9.2, after defining:
```
sage: G = AbelianGroup(2, gens_orders=[16, 16])
sage: f0, f1 = G.gens()
sage: H = G.subgroup ([f0*f1^3])
```
the following correctly determines non-membership:
```…