activity
20092020
most citedAlgebraic Independence in Positive Characteristic -- A p-Adic Calculus

1 citations · 3 across the 3 of their papers we have counts for

collaborators

5 papers

cs.AI2020

Cable Tree Wiring -- Benchmarking Solvers on a Real-World Scheduling Problem with a Variety of Precedence Constraints

Jana Koehler, Joseph Bürgler, Urs Fontana +7

Cable trees are used in industrial products to transmit energy and information between different product parts. To this date, they are mostly assembled by humans and only few autom…

math.CV2016

Effective approximation of the solutions of algebraic equations

Marcin Bilski, Peter Scheiblechner

Let F be a holomorphic map whose components satisfy some polynomial relations. We present an algorithm for constructing Nash maps locally approximating F, whose components satisfy…

math.AG2012★ 1 cited

Effective de Rham Cohomology - The General Case

Peter Scheiblechner

Grothendieck has proved that each class in the de Rham cohomology of a smooth complex affine variety can be represented by a differential form with polynomial coefficients. After h…

cs.CC2012★ 1 cited

Algebraic Independence in Positive Characteristic -- A p-Adic Calculus

Johannes Mittmann, Nitin Saxena, Peter Scheiblechner

A set of multivariate polynomials, over a field of zero or large characteristic, can be tested for algebraic independence by the well-known Jacobian criterion. For fields of other…

math.AG2009★ 1 cited

Castelnuovo-Mumford Regularity and Computing the de Rham Cohomology of Smooth Projective Varieties

Peter Scheiblechner

We describe a parallel polynomial time algorithm for computing the topological Betti numbers of a smooth complex projective variety . It is the first single exponential time alg…