Search results

Page title matches

• Complexity Zoo:Y
  {{CZ-Letter-Menu|Y}} [[Complexity Zoo:Y#yp|YP]] except the advice string s_n can be verified in polynomial time wit
  3 KB (598 words) - 10:20, 15 March 2024
• Template:CZ-Y
  89 bytes (11 words) - 03:10, 18 November 2012

Page text matches

• Zoo Operators
  ...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
• User:HungLAY
  ...: 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 [htt
  245 bytes (38 words) - 17:14, 25 February 2013
• Template:CZ-Menu-Content
  [[Complexity Zoo:Y|Y]] -
  946 bytes (168 words) - 03:10, 18 November 2012
• Template:Simple-Alpha-Menu
  [[#Y|Y]] -
  816 bytes (132 words) - 03:10, 18 November 2012
• Complexity Zoo:Y
  {{CZ-Letter-Menu|Y}} [[Complexity Zoo:Y#yp|YP]] except the advice string s_n can be verified in polynomial time wit
  3 KB (598 words) - 10:20, 15 March 2024
• Template:Reference
  |authors=Y. Chen and J. Flum |authors=Y. Chen and J. Flum
  1 KB (179 words) - 03:10, 18 November 2012
• User:Cschff
  ...ght\}^n</math>, define EQUALITY(''x'', ''y'') = 1 if and only if ''x'' = ''y''.
  3 KB (404 words) - 13:42, 13 February 2013
• Complexity Zoo:K
  ...osure of basic integer arithmetic operations (<math>+, -, \cdot, \lfloor x/y\rfloor</math>, as well as constants 0, 1, and projections) under compositio
  571 bytes (83 words) - 03:10, 18 November 2012
• Complexity Zoo:O
  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 n
  6 KB (1,068 words) - 20:06, 9 May 2024
• Complexity Zoo:E
  <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
• Template:Pp-meta
  ...{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|}}}|&#32;until {{#time:F j, Y|{{{expiry}}}}}}}}}{{{reason<includeonly>|</includeonly>}}}.}}}'''<br /> {{{
  7 KB (813 words) - 19:38, 18 November 2012
• Complexity Zoo:F
  ...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
• Complexity Zoo:T
  ...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
• Complexity Zoo:I
  ...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
• Complexity Zoo:L
  ...all j in S, the predicate &phi;(I,s_j,x,y,j) holds. Here x and y are logarithmic-length strings, or equivalently polynomially bounded number ...ss in which &phi; 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 L
  10 KB (1,744 words) - 15:04, 7 March 2024
• Complexity Zoo:R
  ...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
• Complexity Zoo
  {{CZ-Letter-Section|Y}}
  4 KB (586 words) - 17:57, 2 April 2024
• Complexity Zoo:C
  <li>If P(y)=f(y) for all inputs y, then C^P(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 b
  21 KB (3,514 words) - 17:35, 7 November 2022
• User:Argentpepper/Sandbox/Glossary
  ...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
  23 KB (3,932 words) - 23:10, 1 February 2013
• Complexity Zoo Glossary
  ...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
  24 KB (4,049 words) - 04:21, 18 December 2021

View (previous 20 | next 20) (20 | 50 | 100 | 250 | 500)