# Tag Info

### Algorithm for finding a 3-cycle cover

The cycle cover problem (CC) is the problem of finding a spanning set of cycles in a given directed or undirected input graph. If all the cycles in the cover must consist of at least $k$ edges/arcs, ...
• 5,722

### Implementation of surreal numbers for games

I don't have an answer to your question of whether the theory of Conway games has been used in building game-playing programs, but still you might be interested in the Combinatorial Game Suite, "an ...
• 4,319
Accepted

### Implementation of Wilf-Zeilberger and related methods

It is implemented in Maxima (http://maxima.sourceforge.net/docs/manual/de/maxima_77.html#SEC400), to which Sage has interface. A few dozens of examples (ranging from very easy to very difficult) I ...
Accepted

### Are there any implementations of a graph crossing algorithm?

A slow brute-force implementation of the graph crossing number was added to Sage in Sage Trac ticket 24216: Add crossing number of a graph which was closed 2018-01-05, and merged in Sage 8.2.beta3.

### Implementation of partition trees?

By the definition in the linked paper on page 5, the statement is wrong. Binary space partition (BSP) trees have been used for decades on computer graphics to speed up spatial queries, as have ...
• 674

### Implementation of surreal numbers for games

on some search there do not seem to be much published general implementations of surreal numbers. heres an implementation of surreal numbers in coq. Surreal numbers in coq / Mamane, TYPES'04 ...
• 10.8k
Accepted

### Operations on Sentential Decision Diagrams

I try to address your questions one after the other. I agree that the description of the algorithm is really succinct. To understand it better, I would encourage you to parallel this algorithm with ...
• 1,855

### Implementation of surreal numbers for games

Here is an implementation of Surreal Numbers in a relatively new language, Julia. https://github.com/mroughan/SurrealNumbers.jl Described at https://www.sciencedirect.com/science/article/pii/...
• 21
1 vote

### Word length using entropy : Maximum entropy criteria

Disclaimer: This is based on generic information theory knowledge only. Too long for a comment. Summary: The pointwise product of your two plots should go to some limit, as the relevant blocklengths ...
• 1,996
1 vote

### Powerful Algorithms too complex to implement

Perfect hash construction (https://en.wikipedia.org/wiki/Perfect_hash_function#Construction) would apply to any use-case with static or infrequently-changing keys (e.g. top level domain names on ...

Only top scored, non community-wiki answers of a minimum length are eligible