A promenade through correct test sequences I: Degree of constructible sets, Bézout's Inequality and density

The notion of correct test sequence was introduced in [27]. It has been widely used to design probabilistic algorithms for Polynomial Identity Testing (PIT). In this manuscript we study foundations and generalizations of this notion. We show that correct test sequences are almost omnipresent in the...

Full description

Bibliographic Details

Published in:	Journal of Complexity Vol. 68; p. 101588
Main Authors:	Pardo, Luis M., Sebastián, Daniel
Format:	Journal Article
Language:	English
Published:	Elsevier Inc 01.02.2022
Subjects:	Bounded error probability polynomial time algorithms Bézout's inequality Correct test sequences Degree of constructible and locally closed affine sets Equality test of lists of functions Probability and existence Probability and existence Degree of constructible and locally closed affine sets Bounded error probability polynomial time algorithms Bézout's inequality Correct test sequences Equality test of lists of functions
ISSN:	0885-064X, 1090-2708
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!