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...

Celý popis

Podrobná bibliografie

Vydáno v:	Journal of Complexity Ročník 68; s. 101588
Hlavní autoři:	Pardo, Luis M., Sebastián, Daniel
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Elsevier Inc 01.02.2022
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!