Knowledge

S2P (complexity)

Source đź“ť

914: 649: 804: 407: 78: 748: 584: 316: 348: 953: 251: 167: 196: 112: 831: 949: 859: 589: 17: 753: 551: 1086: 362: 1063: 674: 660: 47: 833:
operator yields a "symmetric hierarchy"; the union of the classes produced in this way is equal to the
722: 834: 557: 289: 37: 321: 1030: 209: 125: 175: 1022: 286:
is closed under unions, intersections, and complements. Comparing the definition with that of
1014: 993: 968: 930: 411: 91: 33: 964: 944: 809: 961: 940: 665: 546: 419: 1049: 1080: 1070: 997: 1034: 1054: 1005:
Russell, Alexander; Sundaram, Ravi (1998). "Symmetric alternation captures BPP".
855: 687: 957: 935: 1026: 972: 532:
These straightforward inclusions can be strengthened to show that the class
479:
always answers false. But such a verifier can easily be transformed into an
1018: 984:
Canetti, Ran (1996). "More on BPP and the polynomial-time hierarchy".
670: 909:{\displaystyle \mathrm {S} _{2}^{p}\subseteq \mathrm {{ZPP}^{NP}} } 516: 439:
is in NP, if and only if there exists a polynomial-time verifier
644:{\displaystyle P^{{\mathsf {S}}_{2}^{P}}={\mathsf {S}}_{2}^{P}} 948:. A preliminary version of this paper appeared earlier, in 36:, intermediate between the first and second levels of the 799:{\displaystyle {\mathsf {S}}_{2}P={\mathsf {S}}_{2}^{P}} 862: 812: 756: 725: 592: 560: 365: 324: 292: 212: 178: 128: 94: 50: 908: 825: 798: 742: 643: 578: 401: 342: 310: 245: 190: 161: 106: 72: 409:. This inclusion can in fact be strengthened to 402:{\displaystyle \Sigma _{2}^{P}\cap \Pi _{2}^{P}} 8: 80:if there exists a polynomial-time predicate 750:as an operator on complexity classes; then 719:As an extension, it is possible to define 277:It is immediate from the definition that S 934: 896: 885: 883: 874: 869: 864: 861: 817: 811: 790: 785: 779: 778: 765: 759: 758: 755: 734: 728: 727: 724: 635: 630: 624: 623: 611: 606: 600: 599: 597: 591: 570: 565: 559: 393: 388: 375: 370: 364: 334: 329: 323: 302: 297: 291: 211: 177: 127: 93: 64: 59: 53: 52: 49: 686:. This result yields a strengthening of 273:Relationship to other complexity classes 923:Journal of Computer and System Sciences 846: 780: 760: 729: 625: 601: 467:answers true, and such that for every 54: 507:) for the same language that ignores 73:{\displaystyle {\mathsf {S}}_{2}^{P}} 7: 350:, it also follows immediately that S 900: 897: 892: 889: 886: 865: 562: 511:and otherwise behaves the same as 385: 367: 326: 294: 14: 1013:(2). Birkhäuser Verlag: 152–162. 743:{\displaystyle {\mathsf {S}}_{2}} 663:states that if every language in 1064:Complexity Class of the Week: S 579:{\displaystyle \Delta _{2}^{P}} 311:{\displaystyle \Sigma _{2}^{P}} 18:computational complexity theory 986:Information Processing Letters 690:'s theorem: it is known that S 435:For by definition, a language 234: 216: 150: 132: 1: 998:10.1016/0020-0190(96)00016-6 550:(by a generalization of the 343:{\displaystyle \Pi _{2}^{P}} 1103: 936:10.1016/j.jcss.2003.07.015 246:{\displaystyle P(x,y,z)=0} 162:{\displaystyle P(x,y,z)=1} 675:polynomial time hierarchy 191:{\displaystyle x\notin L} 1007:Computational Complexity 992:(5). Elsevier: 237–241. 973:10.1109/SFCS.2001.959938 671:polynomial size circuits 552:Sipser–Lautemann theorem 451:), such that for every 910: 827: 800: 744: 645: 580: 403: 344: 312: 265:must be polynomial of 247: 198:, then there exists a 192: 163: 114:, then there exists a 108: 107:{\displaystyle x\in L} 74: 1019:10.1007/s000370050007 911: 828: 826:{\displaystyle S_{2}} 801: 745: 707:) for any fixed  646: 581: 515:. By the same token, 404: 345: 313: 248: 193: 164: 109: 75: 860: 854:Cai, Jin-Yi (2007), 835:Polynomial hierarchy 810: 754: 723: 699:is not contained in 590: 558: 363: 322: 290: 210: 176: 126: 92: 48: 38:polynomial hierarchy 879: 795: 715:Symmetric hierarchy 661:Karp–Lipton theorem 655:Karp–Lipton theorem 640: 616: 575: 398: 380: 339: 307: 69: 1087:Complexity classes 1073:, August 28, 2002. 906: 863: 823: 796: 777: 740: 641: 622: 598: 576: 561: 418:Every language in 399: 384: 366: 340: 325: 308: 293: 243: 202:such that for all 188: 159: 118:such that for all 104: 70: 51: 586:(more generally, 1094: 1038: 1001: 976: 947: 938: 920: 915: 913: 912: 907: 905: 904: 903: 895: 878: 873: 868: 851: 832: 830: 829: 824: 822: 821: 805: 803: 802: 797: 794: 789: 784: 783: 770: 769: 764: 763: 749: 747: 746: 741: 739: 738: 733: 732: 702: 698: 697: 685: 684: 650: 648: 647: 642: 639: 634: 629: 628: 618: 617: 615: 610: 605: 604: 585: 583: 582: 577: 574: 569: 543: 542: 541: 531: 529: 528: 490: 489: 488: 434: 432: 431: 422:also belongs to 408: 406: 405: 400: 397: 392: 379: 374: 359:is contained in 358: 357: 349: 347: 346: 341: 338: 333: 317: 315: 314: 309: 306: 301: 285: 284: 252: 250: 249: 244: 197: 195: 194: 189: 168: 166: 165: 160: 113: 111: 110: 105: 79: 77: 76: 71: 68: 63: 58: 57: 43: 34:complexity class 30: 29: 1102: 1101: 1097: 1096: 1095: 1093: 1092: 1091: 1077: 1076: 1067: 1058: 1045: 1004: 983: 980: 979: 918: 884: 858: 857: 853: 852: 848: 843: 813: 808: 807: 806:. Iteration of 757: 752: 751: 726: 721: 720: 717: 700: 696: 693: 692: 691: 683: 680: 679: 678: 657: 593: 588: 587: 556: 555: 540: 537: 536: 535: 533: 527: 524: 523: 522: 520: 487: 484: 483: 482: 480: 430: 427: 426: 425: 423: 361: 360: 356: 353: 352: 351: 320: 319: 288: 287: 283: 280: 279: 278: 275: 208: 207: 174: 173: 124: 123: 90: 89: 46: 45: 41: 28: 25: 24: 23: 12: 11: 5: 1100: 1098: 1090: 1089: 1079: 1078: 1075: 1074: 1065: 1061: 1056: 1050:Complexity Zoo 1044: 1043:External links 1041: 1040: 1039: 1002: 978: 977: 902: 899: 894: 891: 888: 882: 877: 872: 867: 845: 844: 842: 839: 820: 816: 793: 788: 782: 776: 773: 768: 762: 737: 731: 716: 713: 694: 681: 677:collapses to S 656: 653: 638: 633: 627: 621: 614: 609: 603: 596: 573: 568: 564: 538: 525: 485: 428: 396: 391: 387: 383: 378: 373: 369: 354: 337: 332: 328: 305: 300: 296: 281: 274: 271: 257:where size of 255: 254: 242: 239: 236: 233: 230: 227: 224: 221: 218: 215: 187: 184: 181: 170: 158: 155: 152: 149: 146: 143: 140: 137: 134: 131: 103: 100: 97: 67: 62: 56: 26: 13: 10: 9: 6: 4: 3: 2: 1099: 1088: 1085: 1084: 1082: 1072: 1071:Lance Fortnow 1068: 1062: 1060: 1052: 1051: 1047: 1046: 1042: 1036: 1032: 1028: 1024: 1020: 1016: 1012: 1008: 1003: 999: 995: 991: 987: 982: 981: 974: 970: 966: 963: 959: 955: 951: 946: 942: 937: 932: 928: 924: 917: 880: 875: 870: 850: 847: 840: 838: 836: 818: 814: 791: 786: 774: 771: 766: 735: 714: 712: 710: 706: 689: 676: 672: 668: 667: 662: 659:A version of 654: 652: 636: 631: 619: 612: 607: 594: 571: 566: 553: 549: 548: 518: 514: 510: 506: 502: 498: 494: 478: 474: 470: 466: 462: 459:there exists 458: 454: 450: 446: 442: 438: 421: 416: 414: 413: 394: 389: 381: 376: 371: 335: 330: 303: 298: 272: 270: 268: 264: 260: 240: 237: 231: 228: 225: 222: 219: 213: 205: 201: 185: 182: 179: 171: 156: 153: 147: 144: 141: 138: 135: 129: 121: 117: 101: 98: 95: 87: 86: 85: 83: 65: 60: 40:. A language 39: 35: 31: 19: 1048: 1010: 1006: 989: 985: 929:(1): 25–35, 926: 922: 849: 718: 708: 704: 664: 658: 545: 512: 508: 504: 500: 496: 492: 476: 472: 468: 464: 460: 456: 452: 448: 444: 440: 436: 417: 410: 276: 266: 262: 258: 256: 203: 199: 119: 115: 81: 21: 15: 519:belongs to 841:References 491:predicate 463:for which 84:such that 1027:1016-3328 881:⊆ 673:then the 563:Δ 544:contains 386:Π 382:∩ 368:Σ 327:Π 295:Σ 183:∉ 99:∈ 1081:Category 1035:15331219 958:TR01-030 965:1948751 945:2279029 471:not in 1033:  1025:  956:  952:2001, 943:  688:Kannan 554:) and 44:is in 1031:S2CID 919:(PDF) 517:co-NP 32:is a 1023:ISSN 954:ECCC 950:FOCS 701:SIZE 669:has 318:and 261:and 1015:doi 994:doi 969:doi 931:doi 651:). 455:in 412:ZPP 172:If 88:If 16:In 1083:: 1069:, 1053:: 1029:. 1021:. 1009:. 990:57 988:. 967:, 962:MR 960:, 941:MR 939:, 927:73 925:, 921:, 837:. 711:. 666:NP 547:MA 475:, 420:NP 415:. 269:. 206:, 122:, 20:, 1066:2 1059:P 1057:2 1055:S 1037:. 1017:: 1011:7 1000:. 996:: 975:. 971:: 933:: 916:" 901:P 898:N 893:P 890:P 887:Z 876:p 871:2 866:S 856:" 819:2 815:S 792:P 787:2 781:S 775:= 772:P 767:2 761:S 736:2 730:S 709:k 705:n 703:( 695:2 682:2 637:P 632:2 626:S 620:= 613:P 608:2 602:S 595:P 572:P 567:2 539:2 534:S 530:. 526:2 521:S 513:V 509:z 505:z 503:, 501:y 499:, 497:x 495:( 493:P 486:2 481:S 477:V 473:L 469:x 465:V 461:y 457:L 453:x 449:y 447:, 445:x 443:( 441:V 437:L 433:. 429:2 424:S 395:P 390:2 377:P 372:2 355:2 336:P 331:2 304:P 299:2 282:2 267:x 263:z 259:y 253:, 241:0 238:= 235:) 232:z 229:, 226:y 223:, 220:x 217:( 214:P 204:y 200:z 186:L 180:x 169:, 157:1 154:= 151:) 148:z 145:, 142:y 139:, 136:x 133:( 130:P 120:z 116:y 102:L 96:x 82:P 66:P 61:2 55:S 42:L 27:2 22:S

Index

computational complexity theory
complexity class
polynomial hierarchy
ZPP
NP
co-NP
MA
Sipser–Lautemann theorem
Karp–Lipton theorem
NP
polynomial size circuits
polynomial time hierarchy
Kannan
Polynomial hierarchy
" S 2 p Z P P N P {\displaystyle \mathrm {S} _{2}^{p}\subseteq \mathrm {{ZPP}^{NP}} } "
doi
10.1016/j.jcss.2003.07.015
MR
2279029
FOCS
ECCC
TR01-030
MR
1948751
doi
10.1109/SFCS.2001.959938
doi
10.1016/0020-0190(96)00016-6
doi
10.1007/s000370050007

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

↑