@inproceedings{932fd08646314c3eb37608a10eb210f5,

title = "So the problem has poor complexity: what next?",

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.",

keywords = "complexity, computer algebra, real quantifier elimination",

author = "Davenport, {James H.}",

year = "2023",

month = sep,

day = "11",

doi = "10.1109/SYNASC61333.2023.00057",

language = "English",

isbn = "9798350394139",

series = "Proceedings - 2023 25th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2023",

publisher = "IEEE",

pages = "5--10",

editor = "Sorin Stratulat and Mircea Marin and Viorel Negru and Daniela Zaharie",

booktitle = "Proceedings - 2023 25th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2023",

address = "USA United States",

note = "25th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2023 ; Conference date: 11-09-2023 Through 14-09-2023",

}