We prove an existential version of Gaifman’s locality theorem and show how it can be applied algorithmically to evaluate existential first-order sentences in finite structures....
This is an attempt to simplify and justify the notions of deterministicand randomized reductions, an attempt to derive these notions from (more or less) rst principles.