Pages that link to "Item:Q4371694"
From MaRDI portal
The following pages link to On the combinatorial and algebraic complexity of quantifier elimination (Q4371694):
Displaying 11 items.
- A survey of computational complexity results in systems and control (Q5926262) (← links)
- Back-and-forth systems for generic curves and a decision algorithm for the limit theory (Q5946087) (← links)
- Complexity of cylindrical decompositions of sub-Pfaffian (Q5951564) (← links)
- Truth table invariant cylindrical algebraic decomposition (Q5963392) (← links)
- VerifyRealRoots: a Matlab package for computing verified real solutions of polynomials systems of equations and inequalities (Q6076836) (← links)
- Conic optimization-based algorithms for nonnegative matrix factorization (Q6113533) (← links)
- The parameterized complexity of guarding almost convex polygons (Q6191439) (← links)
- Further \(\exists{\mathbb{R}} \)-complete problems with PSD matrix factorizations (Q6592116) (← links)
- Improved effective Łojasiewicz inequality and applications (Q6652253) (← links)
- The fragment of elementary plane Euclidean geometry based on perpendicularity alone with complexity PSPACE-complete (Q6664346) (← links)
- Faster one block quantifier elimination for regular polynomial systems of equations (Q6666546) (← links)
