Browsing by Subject "T-codes"

Now showing items 1-2 of 2

Counting prime polynomials and measuring complexity and similarity of information

Rebenich, Niko (2016-05-02)

This dissertation explores an analogue of the prime number theorem for polynomials over finite fields as well as its connection to the necklace factorization algorithm T-transform and the string complexity measure T-complexity. ...
Fast Low Memory T-Transform: string complexity in linear time and space with applications to Android app store security.

Rebenich, Niko (2012-04-27)

This thesis presents flott, the Fast Low Memory T-Transform, the currently fastest and most memory efficient linear time and space algorithm available to compute the string complexity measure T-complexity. The flott algorithm ...

Now showing items 1-2 of 2

Search UVicSpace