نتایج جستجو برای: group evaluation polynomial

تعداد نتایج: 1815682  

2015
Daniel König Markus Lohrey

The circuit evaluation problem (also known as the compressed word problem) for finitely generated linear groups is studied. The best upper bound for this problem is coRP, which is shown by a reduction to polynomial identity testing. Conversely, the compressed word problem for the linear group SL3(Z) is equivalent to polynomial identity testing. In the paper, it is shown that the compressed word...

Journal: :Transactions of the American Mathematical Society 1972

Journal: :Pacific Journal of Mathematics 1971

Journal: :Journal of Combinatorial Theory, Series A 2011

Journal: :Proceedings of the American Mathematical Society 1972

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید