Pages that link to "Item:Q2817292"
From MaRDI portal
The following pages link to $$\mathsf {SC}^\mathsf{2} $$ : Satisfiability Checking Meets Symbolic Computation (Q2817292):
Displaying 12 items.
- What does ``without loss of generality'' mean, and how do we detect it (Q1701639) (← links)
- Deciding the consistency of non-linear real arithmetic constraints with a conflict driven search using cylindrical algebraic coverings (Q1996869) (← links)
- Using machine learning to improve cylindrical algebraic decomposition (Q2009221) (← links)
- Efficiently and effectively recognizing toricity of steady state varieties (Q2035620) (← links)
- Complex Golay pairs up to length 28: a search via computer algebra and programmatic SAT (Q2200304) (← links)
- The SAT+CAS method for combinatorial search with applications to best matrices (Q2294574) (← links)
- Editorial: Symbolic computation and satisfiability checking (Q2307620) (← links)
- Cylindrical algebraic decomposition with equational constraints (Q2307622) (← links)
- From simplification to a partial theory solver for non-linear real polynomial constraints (Q2307623) (← links)
- Applying computer algebra systems with SAT solvers to the Williamson conjecture (Q2307627) (← links)
- Satisfiability checking and symbolic computation (Q5268815) (← links)
- Computing with Tarski formulas and semi-algebraic sets in a web browser (Q6170823) (← links)
