Search results
Jump to navigation
Jump to search
Page title matches
- {{CZ-Letter-Menu|Y}} [[Complexity Zoo:Y#yp|YP]] except the advice string s_n can be verified in polynomial time wit3 KB (598 words) - 10:20, 15 March 2024
- 89 bytes (11 words) - 03:10, 18 November 2012
Page text matches
- ...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>.3 KB (550 words) - 22:45, 12 November 2023
- ...: Hung Sharkey<br>My age: 38<br>Country: Great Britain<br>Home town: Bwlch-Y-Groes <br>ZIP: SA35 0RN<br>Address: 92 Caxton Place<br><br>My web-site [htt245 bytes (38 words) - 17:14, 25 February 2013
- [[Complexity Zoo:Y|Y]] -946 bytes (168 words) - 03:10, 18 November 2012
- [[#Y|Y]] -816 bytes (132 words) - 03:10, 18 November 2012
- {{CZ-Letter-Menu|Y}} [[Complexity Zoo:Y#yp|YP]] except the advice string s_n can be verified in polynomial time wit3 KB (598 words) - 10:20, 15 March 2024
- |authors=Y. Chen and J. Flum |authors=Y. Chen and J. Flum1 KB (179 words) - 03:10, 18 November 2012
- ...ght\}^n</math>, define EQUALITY(''x'', ''y'') = 1 if and only if ''x'' = ''y''.3 KB (404 words) - 13:42, 13 February 2013
- ...osure of basic integer arithmetic operations (<math>+, -, \cdot, \lfloor x/y\rfloor</math>, as well as constants 0, 1, and projections) under compositio571 bytes (83 words) - 03:10, 18 November 2012
- See also [[Complexity Zoo:Y#yp|YP]] for an input oblivious analogue of [[Complexity Zoo:N#npiconp|NP &# ...s a polynomial-time predicate P such that, for each length n, there exists y* and z* of length poly(n) such that for all x of length n6 KB (1,068 words) - 20:06, 9 May 2024
- <li>If the answer is "yes" then there exists a y such that M(x,y) accepts.</li> <li>If the answer is "no" then for all y, M(x,y) rejects.</li>15 KB (2,625 words) - 11:06, 22 June 2023
- ...{type}}}}}|indef||{{#if:{{{expiry|}}}|<nowiki> </nowiki>until {{#time:F j, Y|{{{expiry}}}}}}}}}{{#if:{{{icon-reason|}}}|<nowiki> </nowiki>{{{icon-reason ...#ifeq:{{lc:{{{type}}}}}|indef||{{#if:{{{expiry|}}}| until {{#time:F j, Y|{{{expiry}}}}}}}}}{{{reason<includeonly>|</includeonly>}}}.}}}'''<br /> {{{7 KB (813 words) - 19:38, 18 November 2012
- ...edicate F(x,y), if there exists a y satisfying F(x,y) then output any such y, otherwise output 'no.' </ul> ..., since given a predicate F there's no "syntactic" criterion ensuring that y is unique.26 KB (4,511 words) - 01:50, 19 April 2023
- ...polynomial-time predicate F(x,y), output any y satisfying F(x,y). (Such a y is promised to exist.)9 KB (1,541 words) - 17:40, 7 November 2022
- ...or any input y, A returns either "yes", "no", or "I don't know" in time p(|y|).</li>6 KB (1,035 words) - 23:38, 21 October 2022
- ...all j in S, the predicate φ(I,s<sub>j</sub>,x,y,j) holds. Here x and y are logarithmic-length strings, or equivalently polynomially bounded number ...ss in which φ is a first-order predicate without quantifiers and x and y are bounded lists of indices of input bits. LOGNP is also the closure of L10 KB (1,744 words) - 15:04, 7 March 2024
- ...then there exists a distribution Y such that for all distributions Z, M(x,Y,Z) accepts with probability at least 2/3.</li> ...then there exists a distribution Z such that for all distributions Y, M(x,Y,Z) rejects with probability at least 2/3.</li>13 KB (2,129 words) - 22:19, 21 October 2022
- {{CZ-Letter-Section|Y}}4 KB (586 words) - 17:57, 2 April 2024
- <li>If P(y)=f(y) for all inputs y, then C<sup>P</sup>(x) (C with oracle access to P) accepts with probability ...e \neg z)</math> is represented in the CSP construction as <math>C_1(z, x, y) \in I</math>. By similar constructions, any k-SAT problem can be seen to b21 KB (3,514 words) - 17:35, 7 November 2022
- ...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. T23 KB (3,932 words) - 23:10, 1 February 2013
- ...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. T24 KB (4,049 words) - 04:21, 18 December 2021
- <li>If the answer is 'yes,' then there exists a y such that for all z, P(x,y,z) is true.</li> <li>If the answer is 'no,' then there exists a z such that for all y, P(x,y,z) is false.</li>31 KB (5,118 words) - 09:33, 2 May 2024
- ...ght\}^n</math>, define EQUALITY(''x'', ''y'') = 1 if and only if ''x'' = ''y''.29 KB (4,265 words) - 20:34, 26 October 2023
- ...ss, which accept with probability strictly greater than 1/2 when <math>f(x,y) = 1</math> and accept with probably strictly less than 1/2 otherwise. No a10 KB (1,632 words) - 00:03, 10 June 2016
- ...as two inputs, x and y, and accepts on x if there exists a y such that C(x,y)=1.)31 KB (5,129 words) - 04:16, 25 October 2023
- ...x and y respectively, and they wish to evaluate some Boolean function f(x,y) using as few bits of communication as possible. P<sup>cc</sup> is the cla ...that for all z, there exists a w ... such that φ(x,y,z,w,...)," where y,z,w,... are polynomial-size strings and φ is a polynomial-time computab60 KB (9,966 words) - 06:14, 21 September 2023
- ...as two inputs, x and y, and accepts on x if there exists a y such that C(x,y)=1.)42 KB (6,897 words) - 15:10, 12 April 2024
- B. Applebaum, Y. Ishai, and E. Kushilevitz. A. Blass and Y. Gurevich.165 KB (23,490 words) - 20:04, 9 May 2024
- [[zooref#aar04b|[AD14]]] showed that BQP/qpoly = [[Complexity Zoo:Y#yqp|YQP]]/poly.28 KB (4,562 words) - 19:52, 27 March 2023