A Non-2-step Nilsystem With Linear Polynomial Complexity

DOI10.11845/SXJZ.2012172BMaRDI QIDQ5497990zbMATH OpenOpenAlexFDO

Authors Xiangrui Li, Ruifeng Zhang

Publication date 11 February 2015

Full work available at URL http://www.oaj.pku.edu.cn/sxjz/EN/10.11845/sxjz.2012172b

zbMATH Keywords

complexitynilsystemtopological dynamics

Mathematics Subject Classification ID

Topological entropy (37B40)

Recommendations

• scientific article; zbMATH DE number 3978269
• An NP-hardness result for nonlinear systems
• Multilinear polynomial systems: root isolation and bit complexity
• A non-NP-complete algorithm for a quasi-fixed polynomial problem
• Computation of the solutions of nonlinear polynomial systems
• NP-complete problems for systems of linear polynomial's values divisibilities
• On the bit complexity of solving bilinear polynomial systems
• scientific article; zbMATH DE number 3988596
• A strongly polynomial algorithm for linear systems having a binary solution
• scientific article; zbMATH DE number 238284

Cited in

(2)

• Complexity of nilsystems and systems lacking nilfactors
• Infinite-step nilsystems, independence and complexity

This page was built for publication: A Non-2-step Nilsystem With Linear Polynomial Complexity

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