Algorithmic Reformulation of Polynomial Problems

Abstract

This paper considers the problem of existential quantifier elimination for real algebra (QE). It introduces an algorithmic framework for exploring reformulations of QE problems, with the goal of finding reformulations that make difficult problems tractable for QE implementations, or for which these implementations find simpler solutions. The program qfr is introduced, which implements this approach, and its performance on some example problems is reported.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jun 13, 2007
Accession Number
ADA469251

Entities

People

  • Christopher W. Brown

Tags

Communities of Interest

  • Energy and Power Technologies

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Complex Numbers
  • Computer Science
  • Computers
  • Contracts
  • Elimination
  • Equations
  • Heuristic Methods
  • Inequalities
  • Information Operations
  • Intervals
  • Iterations
  • Numbers
  • Polynomials
  • Trees (Data Structures)
  • United States Naval Academy

Readers

  • Adaptive Control and Estimation with Uncertainty in Dynamic Systems.
  • Computational Linguistics
  • Gender and Food Studies