Pages that link to "Item:Q2344759"

The following pages link to A faster algorithm for testing polynomial representability of functions over finite integer rings (Q2344759):

Displaying 6 items.

• The circuit complexity of checking polynomiality for functions over residue ring modulo a composite number is linear (Q357917) (← links)
• Polynomial functions over finite commutative rings (Q1676365) (← links)
• Polynomial functions on rings of dual numbers over residue class rings of the integers (Q2054757) (← links)
• An algorithmic characterization of polynomial functions over \(\mathbb Z_{p^n}\) (Q2258082) (← links)
• Constructing Polynomials for Functions over Residue Rings Modulo a Composite Number in Linear Time (Q2907510) (← links)
• (Q5111252) (← links)