Knowledge

NE (complexity)

Source 📝

184: 119: 78: 325: 344: 318: 219: 166: 105: 148: 140: 91: 32: 17: 144: 311: 291: 349: 195: 58: 129: 133: 97: 8: 299: 61: 28: 21: 269: 295: 264: 245: 36: 338: 183: 118: 233: 54: 336: 67: 319: 147:. Unsourced material may be challenged and 106:Learn how and when to remove these messages 326: 312: 220:Learn how and when to remove this message 167:Learn how and when to remove this message 337: 277: 178: 145:adding citations to reliable sources 112: 71: 13: 345:Theoretical computer science stubs 14: 361: 87:This section has multiple issues. 182: 117: 76: 33:non-deterministic Turing machine 95:or discuss these issues on the 18:computational complexity theory 257: 1: 251: 68:Relationship to other classes 298:. You can help Knowledge by 292:theoretical computer science 7: 239: 53:, unlike the similar class 10: 366: 276: 31:that can be solved by a 294:–related article is a 57:, is not closed under 141:improve this section 232:NE is contained by 62:many-one reductions 350:Complexity classes 194:. You can help by 307: 306: 230: 229: 222: 212: 211: 177: 176: 169: 110: 29:decision problems 357: 328: 321: 314: 283:P ≟ NP 278: 272: 261: 225: 218: 207: 204: 186: 179: 172: 165: 161: 158: 152: 121: 113: 102: 80: 79: 72: 22:complexity class 365: 364: 360: 359: 358: 356: 355: 354: 335: 334: 333: 332: 285: 275: 262: 258: 254: 242: 226: 215: 214: 213: 208: 202: 199: 192:needs expansion 173: 162: 156: 153: 138: 122: 81: 77: 70: 59:polynomial-time 12: 11: 5: 363: 353: 352: 347: 331: 330: 323: 316: 308: 305: 304: 287: 281: 274: 273: 265:Complexity Zoo 255: 253: 250: 249: 248: 246:E (complexity) 241: 238: 228: 227: 210: 209: 189: 187: 175: 174: 125: 123: 116: 111: 85: 84: 82: 75: 69: 66: 27:is the set of 9: 6: 4: 3: 2: 362: 351: 348: 346: 343: 342: 340: 329: 324: 322: 317: 315: 310: 309: 303: 301: 297: 293: 288: 284: 280: 279: 271: 267: 266: 260: 256: 247: 244: 243: 237: 235: 224: 221: 206: 203:February 2023 197: 193: 190:This section 188: 185: 181: 180: 171: 168: 160: 157:February 2023 150: 146: 142: 136: 135: 131: 126:This section 124: 120: 115: 114: 109: 107: 100: 99: 94: 93: 88: 83: 74: 73: 65: 63: 60: 56: 52: 48: 46: 42: 38: 34: 30: 26: 23: 19: 300:expanding it 289: 282: 263: 259: 231: 216: 200: 196:adding to it 191: 163: 154: 139:Please help 127: 103: 96: 90: 89:Please help 86: 50: 49: 44: 40: 24: 15: 43:) for some 339:Categories 252:References 92:improve it 128:does not 98:talk page 240:See also 234:NEXPTIME 55:NEXPTIME 35:in time 149:removed 134:sources 286:  20:, the 290:This 296:stub 132:any 130:cite 198:. 143:by 16:In 341:: 270:NE 268:: 236:. 101:. 64:. 51:NE 47:. 25:NE 327:e 320:t 313:v 302:. 223:) 217:( 205:) 201:( 170:) 164:( 159:) 155:( 151:. 137:. 108:) 104:( 45:k 41:k 39:( 37:O

Index

computational complexity theory
complexity class
decision problems
non-deterministic Turing machine
O
NEXPTIME
polynomial-time
many-one reductions
improve it
talk page
Learn how and when to remove these messages

cite
sources
improve this section
adding citations to reliable sources
removed
Learn how and when to remove this message

adding to it
Learn how and when to remove this message
NEXPTIME
E (complexity)
Complexity Zoo
NE
theoretical computer science
stub
expanding it
v
t

Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.