Search results

...ists a string y, of length <math>|y| \leq p(|x|)</math> such that <math>(x,y) \in V</math>. ...or all strings y of length <math>|y| \leq p(|x|)</math> such that <math>(x,y) \in V</math>.

{{CZ-Letter-Section|Y}}

...math>S</math> of variables such that <math>f(Y)=f(X)</math> whenever <math>Y</math> agrees with <math>X</math> on every variable in <math>S</math>. The ...\{0,1\}^n</math> for some <math>n</math>, their Hamming distance <math>d(x,y)</math> is the number of bits that are different between the two strings. T

...ght\}^n</math>, define EQUALITY(''x'', ''y'') = 1 if and only if ''x'' = ''y''.

B. Applebaum, Y. Ishai, and E. Kushilevitz. A. Blass and Y. Gurevich.