"How Lower and Upper Complexity Bounds Meet in Elimination Theory."

Luis Miguel Pardo (1995)

Details and statistics

DOI: 10.1007/3-540-60114-7_4

access: closed

type: Conference or Workshop Paper

metadata version: 2022-01-03

a service of  Schloss Dagstuhl - Leibniz Center for Informatics