Log-space reduction is a concept in computational complexity theory that is used to compare the relative difficulty of problems in terms of space complexity. Specifically, it is a type of many-one reduction that allows one computational problem to be transformed into another in logarithmic space.
Articles by others on the same topic
There are currently no matching articles.