Abstract

Some interesting problems have a poor worst-case complexity, but may still be soluble in some, or many, cases. If appropriate, there is 'fixed-parameter tractability' as one way of describing the solubility. We can also look at weak complexity (i.e. ignoring rare bad cases, but in a principled way). But in other cases, e.g. SAT-solving, there isn't necessarily a neat theoretical solution, but powerful practical ideas. In particular, we look at computer algebra, and particularly real quantifier elimination.11The author was partially supported by EPSRC grant EP/T015713.

Original languageEnglish
Title of host publicationProceedings - 2023 25th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2023
EditorsSorin Stratulat, Mircea Marin, Viorel Negru, Daniela Zaharie
Place of PublicationU. S. A.
PublisherIEEE
Pages5-10
Number of pages6
ISBN (Electronic)9798350394122
ISBN (Print)9798350394139
DOIs
Publication statusE-pub ahead of print - 11 Sept 2023
Event25th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2023 - Nancy, France
Duration: 11 Sept 202314 Sept 2023

Publication series

NameProceedings - 2023 25th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2023

Conference

Conference25th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2023
Country/TerritoryFrance
CityNancy
Period11/09/2314/09/23

Keywords

  • complexity
  • computer algebra
  • real quantifier elimination

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Computer Science Applications
  • Software
  • Numerical Analysis
  • Computational Mathematics
  • Health Informatics

Cite this