Pages that link to "Item:Q2457384"

The following pages link to Cylindrical algebraic decomposition using validated numerics (Q2457384):

Displaying 50 items.

• Synthesis of optimal numerical algorithms using real quantifier elimination (case study: square root computation) (Q3452390) (← links)
• Sub-cubic change of ordering for Gröbner basis (Q3452391) (← links)
• Sparse Gröbner bases (Q3452392) (← links)
• The <i>MMO</i> problem (Q3452393) (← links)
• Factoring linear differential operators in <i>n</i> variables (Q3452394) (← links)
• Online order basis algorithm and its impact on the block Wiedemann algorithm (Q3452395) (← links)
• On isomorphisms of modules over non-commutative PID (Q3452396) (← links)
• Radical solutions of first order autonomous algebraic ordinary differential equations (Q3452397) (← links)
• Computing low-degree factors of lacunary polynomials (Q3452398) (← links)
• Maximum likelihood geometry in the presence of data zeros (Q3452399) (← links)
• Constructing fewer open cells by GCD computation in CAD projection (Q3452400) (← links)
• An <i>a posteriori</i> certification algorithm for Newton homotopies (Q3452402) (← links)
• Evaluating parametric holonomic sequences using rectangular splitting (Q3452403) (← links)
• Equivariant lattice generators and Markov bases (Q3452404) (← links)
• Sparse polynomial interpolation codes and their decoding beyond half the minimum distance (Q3452405) (← links)
• Sparse multivariate function recovery with a high error rate in the evaluations (Q3452406) (← links)
• Bounds for D-finite closure properties (Q3452407) (← links)
• Powers of tensors and fast matrix multiplication (Q3452408) (← links)
• Reduction among bracket polynomials (Q3452409) (← links)
• Formal solutions of a class of Pfaffian systems in two variables (Q3452410) (← links)
• On the reduction of singularly-perturbed linear differential systems (Q3452411) (← links)
• High performance implementation of the TFT (Q3452412) (← links)
• Randomized detection of extraneous factors (Q3452413) (← links)
• Toric border basis (Q3452414) (← links)
• On efficient algorithms for computing parametric local cohomology classes associated with semi-quasihomogeneous singularities and standard bases (Q3452415) (← links)
• A near-optimal algorithm for computing real roots of sparse polynomials (Q3452416) (← links)
• LLL reducing with the most significant bits (Q3452418) (← links)
• Covering of surfaces parametrized without projective base points (Q3452419) (← links)
• Linear independence oracles and applications to rectangular and low rank linear systems (Q3452420) (← links)
• Faster relaxed multiplication (Q3452421) (← links)
• Unimodular completion of polynomial matrices (Q3452422) (← links)
• Applied Algebraic Geometry in Model Based Design for Manufacturing (Q3455008) (← links)
• Parametric Qualitative Analysis of Ordinary Differential Equations: Computer Algebra Methods for Excluding Oscillations (Extended Abstract) (Invited Talk) (Q3587714) (← links)
• (Q4437589) (← links)
• Approximation via Correlation Decay When Strong Spatial Mixing Fails (Q4634020) (← links)
• Variable Ordering Selection for Cylindrical Algebraic Decomposition with Artificial Neural Networks (Q5041065) (← links)
• Real World Verification (Q5191121) (← links)
• Problem Formulation for Truth-Table Invariant Cylindrical Algebraic Decomposition by Incremental Triangular Decomposition (Q5495913) (← links)
• Applying Machine Learning to the Problem of Choosing a Heuristic to Select the Variable Ordering for Cylindrical Algebraic Decomposition (Q5495916) (← links)
• Matrix-F5 algorithms over finite-precision complete discrete valuation fields (Q5891054) (← links)
• Quantifier elimination by cylindrical algebraic decomposition based on regular chains (Q5899515) (← links)
• Logspace computations in graph products (Q5899516) (← links)
• Tame decompositions and collisions (Q5899518) (← links)
• Truth table invariant cylindrical algebraic decomposition (Q5963392) (← links)
• Cylindrical algebraic decomposition using local projections (Q5963393) (← links)
• Explainable AI insights for symbolic computation: a case study on selecting the variable ordering for cylindrical algebraic decomposition (Q6149145) (← links)
• Computing with Tarski formulas and semi-algebraic sets in a web browser (Q6170823) (← links)
• Cylindrical algebraic decomposition using local projections (Q6487176) (← links)
• Faster one block quantifier elimination for regular polynomial systems of equations (Q6666546) (← links)
• Choosing the variable ordering for cylindrical algebraic decomposition via exploiting chordal structure (Q6666548) (← links)