Counting prime polynomials and measuring complexity and similarity of information
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. Specifically, a precise asymptotic expansion for the prime polynomial co...
| Main Author: | |
|---|---|
| Other Authors: | |
| Language: | English en |
| Published: |
2016
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1828/7251 |