filmov
tv
Elementary Recursive Quantifier Elimination Based on Thom Encoding and Sign Determination Part 2
Показать описание
Real Algebraic Geometry Seminar, Marie-Françoise Roy, Universite de Rennes 1
Thursday, Jan 26 11:00 am - 12:00 pm
Elementary Recursive Quantifier Elimination Based on Thom Encoding and Sign Determination
Abstract: We describe a new quantifier elimination algorithm for real closed fields based on Thom encoding and sign determination. The complexity of this algorithm is elementary recursive and its proof of correctness is completely algebraic. In particular, the notion of connected components of semialgebraic sets is not used.
Thursday, Jan 26 11:00 am - 12:00 pm
Elementary Recursive Quantifier Elimination Based on Thom Encoding and Sign Determination
Abstract: We describe a new quantifier elimination algorithm for real closed fields based on Thom encoding and sign determination. The complexity of this algorithm is elementary recursive and its proof of correctness is completely algebraic. In particular, the notion of connected components of semialgebraic sets is not used.
0:51:24
0:03:58
0:27:32
0:48:50
0:04:27
![[CPP'23] A First](https://i.ytimg.com/vi/lEk6kSTswTQ/hqdefault.jpg)
0:23:54
0:47:38
0:56:37
0:52:50
0:14:39
0:45:11
0:00:11
1:18:35
0:11:56
1:05:39
1:26:30
0:53:03
0:45:47
1:42:45
0:02:52
0:31:31
0:50:27
0:16:16
1:07:51