1 paper · 1 filter
Vladimir Naidenko
Descriptive complexity theory is an important area in the study of computational complexity. In this direction, it is possible to describe combinatorial problems exclusively by log…