Jordan

swMATH23624MaRDI QIDQ35395FDOQ35395

Author name not available (Why is that?)

Source code repository: https://github.com/jrh13/hol-light/tree/master/Jordan

Cited In (64)

• Tame decompositions and collisions
• Logspace computations in graph products
• Constructing fewer open cells by GCD computation in CAD projection
• Online order basis algorithm and its impact on the block Wiedemann algorithm
• Maximum likelihood geometry in the presence of data zeros
• Evaluating parametric holonomic sequences using rectangular splitting
• Fuzzy simplification of non-numeric expressions containing some intervals and/or floating point numbers
• High performance implementation of the TFT
• Solving higher order linear differential equations having elliptic function coefficients
• Sparse polynomial interpolation codes and their decoding beyond half the minimum distance
• The asymptotic analysis of some interpolated nonlinear recurrence relations
• Linear independence oracles and applications to rectangular and low rank linear systems
• Computing necessary integrability conditions for planar parametrized homogeneous potentials
• Equivariant lattice generators and Markov bases
• Matrix-F5 algorithms over finite-precision complete discrete valuation fields
• An intuitionistic proof of a discrete form of the Jordan curve theorem formalized in Coq with combinatorial hypermaps
• Toric border basis
• Sub-cubic change of ordering for Gröbner basis
• Formalization of Bing’s Shrinking Method in Geometric Topology
• Optimal positioning of anodes and virtual sources in the design of cathodic protection systems using the method of fundamental solutions
• An a posteriori certification algorithm for Newton homotopies
• Faster relaxed multiplication
• Multivariate sparse interpolation using randomized Kronecker substitutions
• On the computation of the topology of plane curves
• Quantifier elimination by cylindrical algebraic decomposition based on regular chains
• A near-optimal algorithm for computing real roots of sparse polynomials
• Essentially optimal interactive certificates in linear algebra
• Fast arithmetic for the algebraic closure of finite fields
• Bounds for D-finite closure properties
• Powers of tensors and fast matrix multiplication
• Formal solutions of a class of Pfaffian systems in two variables
• On efficient algorithms for computing parametric local cohomology classes associated with semi-quasihomogeneous singularities and standard bases
• On the reduction of singularly-perturbed linear differential systems
• Mathematics by machine
• A generalized Apagodu-Zeilberger algorithm
• LLL reducing with the most significant bits
• Randomized detection of extraneous factors
• The MMO problem
• The Jordan Curve Theorem, Formally and Informally
• On isomorphisms of modules over non-commutative PID
• Synthesis of optimal numerical algorithms using real quantifier elimination (case study: square root computation)
• A fast algorithm for computing the characteristic polynomial of the p-curvature
• Sparse multivariate function recovery with a high error rate in the evaluations
• Planar nearrings on the Euclidean plane.
• Root counts of semi-mixed systems, and an application to counting nash equilibria
• A new deterministic algorithm for sparse multivariate polynomial interpolation
• Without Loss of Generality
• Factoring linear differential operators in n variables
• Sparse interpolation over finite fields via low-order roots of unity
• Formalizing Ordinal Partition Relations Using Isabelle/HOL
• Computing the differential Galois group of a parameterized second-order linear differential equation
• Parallel telescoping and parameterized Picard-Vessiot theory
• Computing low-degree factors of lacunary polynomials
• Computational logic: its origins and applications
• The HOL Light theory of Euclidean space
• Improved algorithm for computing separating linear forms for bivariate systems
• Reliability of mathematical inference
• A revision of the proof of the Kepler conjecture
• Covering of surfaces parametrized without projective base points
• Radical solutions of first order autonomous algebraic ordinary differential equations
• Sparse Gröbner bases
• HOL Light: An Overview
• Reduction among bracket polynomials
• Unimodular completion of polynomial matrices

This page was built for software: Jordan