Pages that link to "Item:Q2819729"
From MaRDI portal
The following pages link to Building Bridges between Symbolic Computation and Satisfiability Checking (Q2819729):
Displaying 13 items.
- A nonexistence certificate for projective planes of order ten with weight 15 codewords (Q780361) (← links)
- 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)
- 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)
- Applying computer algebra systems with SAT solvers to the Williamson conjecture (Q2307627) (← links)
- $$\mathsf {SC}^\mathsf{2} $$ : Satisfiability Checking Meets Symbolic Computation (Q2817292) (← links)
- MathCheck2: A SAT+CAS Verifier for Combinatorial Conjectures (Q2829996) (← links)
- Efficient Simplification Techniques for Special Real Quantifier Elimination with Applications to the Synthesis of Optimal Numerical Algorithms (Q2830000) (← links)
- Satisfiability Checking: Theory and Applications (Q4571125) (← links)
- Nonexistence Certificates for Ovals in a Projective Plane of Order Ten (Q5041183) (← links)
- Satisfiability checking and symbolic computation (Q5268815) (← links)
