Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Scheiblechner, Peter - Hausdorff Center for Mathematics. Universität Bonn
On the Complexity of Counting Irreducible Components and Computing
On the Complexity of Deciding Connectedness and Computing Betti
Castelnuovo-Mumford Regularity and Computing the de Rham Cohomology of Smooth Projective
On Lower Bounds for Algebraic Decision Trees over the Complex Numbers
Differential Forms in Computational Algebraic Geometry [Extended Abstract]
ALGEBRAIC INDEPENDENCE IN POSITIVE CHARACTERISTIC A p-ADIC CALCULUS
COUNTING IRREDUCIBLE COMPONENTS OF COMPLEX
Counting Connected Components of Hypersurfaces
On the Complexity of Counting Components of Algebraic Varieties
Comparison of Complexity over the Real vs. Complex Numbers Peter Scheiblechner
On a Generalization of Stickelberger's Peter Scheiblechner
Effective de Rham Cohomology -The Hypersurface Case Peter Scheiblechner
