Web Supplement for the 2D Linear Minimal Lebesgue Constant Project (2021):
Description.
The goal of this project to systematically investigate and describe
the polynomial inequality systems which enable to compute the solution of
the optimal 2DLeb constant in a scalabale fashion and to provide benchmarks
for SAT SOLVERS for nonlinear real arithemtic (existential fragment
or existential RQE).
In the current form it is a web repository which contains a list of Results and Benchmark Problems for symbolic computation. This page is also thought as a web supplement of researh articles.
Problem Inputs (2DUS, [0,1]2, var 2(1)):
[MMA-QEPCAD-INTLAB-PARI-GP]
[Tarski--QFNRA-1]
[Tarski--QFRNA-2]
Problem Inputs (2DUS, [0,1]2, var 3(2)):
[MMA-QEPCAD-INTLAB-PARI-GP-2]
[Tarski--QFNRA-3]
[Tarski--QFNRA-4]
Problem Inputs (2DUS, [0,1]2, var 4(3)-a):
[MMA-QEPCAD-INTLAB-PARI-GP-3]
[Tarski--QFNRA-5]
[Tarski--QFNRA-6]
Problem Inputs (2DUS, [0,1]2, var 4(3)-b):
[MMA-QEPCAD-INTLAB-PARI-GP-4]
[Tarski--QFNRA-7]
[Tarski--QFNRA-8]
Robert Vajda