1 citations · 1 across the 3 of their papers we have counts for
1 paper · 1 filter
Andrey Nechesov
The problem to be solved in this paper is to construct a general method of proving whether a certain set is p-computable or not. The method is based on a polynomial analogue of the…