Deciding linear-trigonometric problems

DOI10.1145/345542.345567MaRDI QIDQ3454738zbMATH OpenOpenAlexFDO

Authors Hirokazu Anai, Volker Weispfenning

Publication date 26 November 2015

Published in Proceedings of the 2000 international symposium on Symbolic and algebraic computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/345542.345567

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Factorization (11Y05) Number-theoretic algorithms; complexity (11Y16)

Recommendations

• scientific article; zbMATH DE number 1574496
• Deciding polynomial-transcendental problems
• Quantifier elimination for trigonometric polynomials by cylindrical trigonometric decomposition
• scientific article; zbMATH DE number 512972
• Deciding polynomial-exponential problems

Cited in

(5)

• scientific article; zbMATH DE number 1574496 (Why is no real title available?)
• Decidability bounds for Presburger arithmetic extended by sine
• Deciding first-order formulas involving univariate mixed trigonometric-polynomials
• Reduction of transcendental decision problems over the reals
• Decision problem for a class of univariate Pfaffian functions

This page was built for publication: Deciding linear-trigonometric problems

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