Given a cubic equation x1y1z1 + x 2y2z2 + ⋯ + xny nzn = b over a finite field, it is necessary to determine the minimal number of systems of linear equations over the same field such that the union of their solutions exactly coincides with the set of solutions of the initial equation. The problem is solved for arbitrary size of the field. A covering with almost minimum complexity is constructed.
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Geometry and Topology
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics
- Applied Mathematics