Analysing All Polynomial Equations in {\mathbb Z_{2w}}

DOI10.1007/978-3-540-69166-2_20MaRDI QIDQ3522079zbMATH OpenOpenAlexFDO

Authors Helmut Seidl, Andrea Flexeder, Michael Petter

Publication date 28 August 2008

Published in Static Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-69166-2_20

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Semantics in the theory of computing (68Q55) Symbolic computation and algebraic computation (68W30)

Recommendations

• Polynomial functions on the units of \(\mathbb{Z}_{2^n}\)
• Counting roots of polynomials over $\mathbb{Z}/p^2\mathbb{Z}$
• On the composition of polynomials of the form \(z^2+c_n\)
• Polynomial equations in \(\mathbb{F}_q [t]\)
• An algorithmic characterization of polynomial functions over \(\mathbb Z_{p^n}\)
• scientific article; zbMATH DE number 962549
• Publication:4732706
• New Computational Paradigms
• Analogues of the 3x+1 problem in polynomial rings of characteristic 2
• Solutions of polynomial equations in subgroups of \(\mathbb{F}_p^*\)

Cites work

• A generalization of the Smarandache function to several variables
• Affine relationships among variables of a program
• Automatic generation of polynomial invariants of bounded degree using abstract interpretation
• Computing polynomial program invariants
• scientific article; zbMATH DE number 1692940 (Why is no real title available?)
• scientific article; zbMATH DE number 43569 (Why is no real title available?)
• scientific article; zbMATH DE number 1948385 (Why is no real title available?)
• scientific article; zbMATH DE number 217454 (Why is no real title available?)
• Interprocedurally Analyzing Polynomial Identities
• Non-linear loop invariant generation using Gröbner bases
• On polynomial functions (mod m)
• Polynomial approximations of the relational semantics of imperative programs
• Programming Languages and Systems
• Static Analysis

Cited in

(1)

• Programming Languages and Systems

This page was built for publication: Analysing All Polynomial Equations in ${\mathbb Z_{2^w}}$

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3522079)