On the combinatorial and algebraic complexity of quantifier elimination

Author:

Basu Saugata1,Pollack Richard1,Roy Marie-Françoise2

Affiliation:

1. New York Univ., New York, NY

2. Univ. de Rennes, Rennes, France

Abstract

In this paper, a new algorithm for performing quantifier elimination from first order formulas over real closed fields in given. This algorithm improves the complexity of the asymptotically fastest algorithm for this problem, known to this data. A new feature of this algorithm is that the role of the algebraic part (the dependence on the degrees of the imput polynomials) and the combinatorial part (the dependence on the number of polynomials) are sparated. Another new feature is that the degrees of the polynomials in the equivalent quantifier-free formula that is output, are independent of the number of input polynomials. As special cases of this algorithm new and improved algorithms for deciding a sentence in the first order theory over real closed fields, and also for solving the existential problem in the first order theory over real closed fields, are obtained.

Publisher

Association for Computing Machinery (ACM)

Subject

Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software

Reference38 articles.

1. ~ATIYAH M. F. AND MACONALD I.G. 1969. Introduction to Commutative Algebra. Addison-Wesley ~Reading Pa.]] ~ATIYAH M. F. AND MACONALD I.G. 1969. Introduction to Commutative Algebra. Addison-Wesley ~Reading Pa.]]

2. On the number of cells defined by a family of ~polynomials on a variety;~BASU S.;Mathematika,1996

Cited by 194 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Solving Tensor Low Cycle Rank Approximation;2023 IEEE International Conference on Big Data (BigData);2023-12-15

2. The Parameterized Complexity of Guarding Almost Convex Polygons;Discrete & Computational Geometry;2023-12-05

3. Faster real root decision algorithm for symmetric polynomials;Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation;2023-07-24

4. Further $$\exists {\mathbb {R}}$$-Complete Problems with PSD Matrix Factorizations;Foundations of Computational Mathematics;2023-06-22

5. Conic optimization-based algorithms for nonnegative matrix factorization;Optimization Methods and Software;2023-04-24

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3