4 citations · 10 across the 14 of their papers we have counts for
6 papers · 1 filter
SAT Solving Using XOR-OR-AND Normal Forms
Bernhard Andraschko, Julian Danner, Martin Kreuzer
This paper introduces the XOR-OR-AND normal form (XNF) for logical formulas. It is a generalization of the well-known Conjunctive Normal Form (CNF) where literals are replaced by X…
Decomposing Finite -Algebras
Martin Kreuzer, Alexei Miasnikov, Florian Walsh
For a finite -algebra , i.e., for a ring which is not necessarily associative or unitary, but whose additive group is finitely generated, we construct a decompositio…
Efficient Algorithms for Finite -Algebras
Martin Kreuzer, Florian Walsh
For a finite -algebra , i.e., for a -algebra which is a finitely generated -module, we assume that is explicitly given by a system of $\m…
Computing the Binomial Part of a Polynomial Ideal
Martin Kreuzer, Florian Walsh
Given an ideal in a polynomial ring over a field , we present a complete algorithm to compute the binomial part of , i.e., the subideal …
Re-embeddings of Affine Algebras Via Gröbner Fans of Linear Ideals
Martin Kreuzer, Le Ngoc Long, Lorenzo Robbiano
Given an affine algebra over a field , where is an ideal in the polynomial ring , we examine the task of effectively calculating r…
Differential theory of zero-dimensional schemes
Martin Kreuzer, Tran N. K. Linh, Le N. Long
For a 0-dimensional scheme in over a perfect field , we first embed the homogeneous coordinate ring into its truncated integral closure $\widetil…