Pages that link to "Item:Q2907510"
From MaRDI portal
The following pages link to Constructing Polynomials for Functions over Residue Rings Modulo a Composite Number in Linear Time (Q2907510):
Displaying 10 items.
- The circuit complexity of checking polynomiality for functions over residue ring modulo a composite number is linear (Q357917) (← links)
- Composing power series over a finite ring in essentially linear time (Q1267071) (← links)
- On the number of functions of \(k\)-valued logic which are polynomials modulo composite \(k\) (Q1675517) (← links)
- Constructing composition factors for a linear group in polynomial time (Q2193255) (← links)
- Learning read-constant polynomials of constant degree modulo composites (Q2254504) (← links)
- A faster algorithm for testing polynomial representability of functions over finite integer rings (Q2344759) (← links)
- Learning Read-Constant Polynomials of Constant Degree Modulo Composites (Q3007614) (← links)
- Finding the subsets of variables of a partial Boolean function which are sufficient for its implementation in the classes defined by predicates (Q5090147) (← links)
- On complexity of searching for periods of functions given by polynomials over a prime field (Q5878613) (← links)
- Checking the polynomiality of single-variable functions of \({k}\)-valued logic composite modulo \({k}\) (Q6572946) (← links)
