SMT solving over finite field arithmetic
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 545277 (Why is no real title available?)
- scientific article; zbMATH DE number 2151220 (Why is no real title available?)
- scientific article; zbMATH DE number 1827070 (Why is no real title available?)
- A model-constructing satisfiability calculus
- A new efficient algorithm for computing Gröbner bases (F₄)
- Algebraic approaches to stability analysis of biological systems
- An elimination method for polynomial systems
- Bruno Buchberger's PhD thesis 1965: An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal. Translation from the German
- Characteristic set algorithms for equation solving in finite fields
- Computing triangular systems and regular systems
- Contemporary abstract algebra
- Cutting to the chase. Solving linear integer arithmetic
- Decomposing polynomial sets into simple sets over finite fields: the zero-dimensional case
- Efficient algorithms for solving overdefined systems of multivariate polynomial equations
- Elimination methods
- Hybrid approach for solving multivariate systems over finite fields
- On the theories of triangular sets
- Parametric equation solving and quantifier elimination in finite fields with the characteristic set method
- Polybori: A framework for Gröbner-basis computations with Boolean polynomials
- Quantifier elimination over finite fields using Gröbner bases
- Real quantifier elimination is doubly exponential
- Solving non-linear arithmetic
- Solving polynomial systems over finite fields: improved analysis of the hybrid approach
- The Knowledge Complexity of Interactive Proof Systems
- Triangular sets for solving polynomial systems: a comparative implementation of four methods
Cited in
(3)
This page was built for publication: SMT solving over finite field arithmetic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7025216)
