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