9 citations
- Centre National de la Recherche ScientifiqueFR11 papers
- Sorbonne UniversitéFR8 papers
- LIP6FR4 papers
- XLIMFR4 papers
- Université de LimogesFR3 papers
- Centre Européen de Recherche et de Formation Avancée en Calcul ScientifiqueFR2 papers
- Centre Inria de SaclayFR2 papers
- Centre National d'Études SpatialesFR2 papers
- École Pour l'Informatique et les Techniques AvancéesFR2 papers
- Laboratoire d'Informatique de l'École PolytechniqueFR2 papers
- North Carolina State UniversityUS2 papers
- North Central State CollegeUS2 papers
10 papers · 1 filter
Extracting Linear Relations from Gröbner Bases for Formal Verification of And-Inverter Graphs
Daniela Kaufmann, Jérémy Berthomieu
Formal verification techniques based on computer algebra have proven highly effective for circuit verification. The circuit, given as an and-inverter graph, is encoded as a set of…
Quantum-Safe Hybrid Key Exchanges with KEM-Based Authentication
Christopher Battarbee, Christoph Striecks, Ludovic Perret +2
Authenticated Key Exchange (AKE) between any two entities is one of the most important security protocols available for securing our digital networks and infrastructures. In PQCryp…
Jacobi Stability Analysis for Systems of ODEs Using Symbolic Computation
Bo Huang, Dongming Wang, Jing Yang
The classical theory of Kosambi-Cartan-Chern (KCC) developed in differential geometry provides a powerful method for analyzing the behaviors of dynamical systems. In the KCC theory…
Faster computation of Whitney stratifications and their minimization
Martin Helmer, Rafael Mohr
We describe two new algorithms for the computation of Whitney stratifications of real and complex algebraic varieties. The first algorithm is a modification of the algorithm of Hel…
On the configurations of four spheres supporting the vertices of a tetrahedron
Marco Longinetti, Simone Naldi
A reformulation of the three circles theorem of Johnson with distance coordinates to the vertices of a triangle is explicitly represented in a polynomial system and solved by symbo…
Certifying solutions of degenerate semidefinite programs
Vladimir Kolmogorov, Simone Naldi, Jeferson Zapata
This paper deals with the algorithmic aspects of solving feasibility problems of semidefinite programming (SDP), aka linear matrix inequalities (LMI). Since in some SDP instances a…