bibliographer - Pascal Koiran

bibliographer a curated TCS bibliography

obsidian
tags
authors
no doi
no pdf
bad author
add item
librarian

An efficient uniqueness theorem for overcomplete tensor decomposition Pascal Koiran [github]

VPSPACE and a Transfer Theorem over the Reals Pascal Koiran Sylvain Perifel [github]

Expressing a Fraction of Two Determinants as a Determinant Erich Kaltofen Pascal Koiran [github]

The complexity of two problems on arithmetic circuits Pascal Koiran Sylvain Perifel [github]

Computability with low-dimensional dynamical systems Pascal Koiran Michel Cosnard Max Garzon [github]

Hilbert's Nullstellensatz Is in the Polynomial Hierarchy Pascal Koiran [github]

On the complexity of the multivariate resultant Bruno Grenet Pascal Koiran Natacha Portier [github]

Quantum Automata and Algebraic Groups Harm Derksen Emmanuel Jeandel Pascal Koiran [github]

VPSPACE and a Transfer Theorem over the Reals Pascal Koiran Sylvain Perifel [github]

A textdollartextdollartextbackslashtau textdollartextdollar tau -Conjecture for Newton Polygons Pascal Koiran Natacha Portier Sébastien Tavenas Stéphan Thomassé [github]

On the complexity of factoring bivariate supersparse (Lacunary) polynomials Erich Kaltofen Pascal Koiran [github]

Finding small degree factors of multivariate supersparse (lacunary) polynomials over algebraic number fields Erich Kaltofen Pascal Koiran [github]

Library Size: 13G (12 entries), Last Updated: Apr 04, 2026, 18:14:59, Build Time: N/A

[show logs] [hide logs]