Separating Cook Completeness from Karp-Levin Completeness Under a Worst-Case Hardness Hypothesis

We show that there is a language that is Turing complete for NP but not many-one complete for NP, under a worst-case hardness hypothesis. Our hypothesis asserts the existence of a non-deterministic, double-exponential time machine that runs in time O(2^2^n^c) (for some c > 1) accepting Sigma^* whose accepting computations cannot be computed by bounded-error, probabilistic machines running in time O(2^2^{beta * 2^n^c) (for some beta > 0). This is the first result that separates completeness notions for NP under a worst-case hardness hypothesis

LIPIcs, Volume 251, ITCS 2023, Complete Volume

LIPIcs, Volume 251, ITCS 2023, Complete Volum

On the Difference Between Polynomial-Time Many-One and Truth-Table Reducibilities on Distributional Problems

. In this paper we separate many-one reducibility from truth-table reducibility for distributional problems in DistNP under the hypothesis that P #= NP. As a first example we consider the 3-Satisfiability problem (3SAT) with two di#erent distributions on 3CNF formulas. We show that 3SAT using a version of the standard distribution is truth-table reducible but not many-one reducible to 3SAT using a less redundant distribution unless P = NP. We extend this separation result and define a distributional complexity class C with the following properties: (1) C is a subclass of DistNP , this relation is proper unless P = NP . (2) C contains DistP , but it is not contained in AveP unless DistNP # AveZPP . (3) C has a # p m-complete set. (4) C has a # p tt -complete set that is not # p m-complete unless P = NP . This shows that under the assumption that P #= NP , the two completeness notions di#er on some non-trivial subclass of DistNP . 1 Introduction Sinc..

Tools and Algorithms for the Construction and Analysis of Systems

This open access two-volume set constitutes the proceedings of the 27th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2021, which was held during March 27 – April 1, 2021, as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2021. The conference was planned to take place in Luxembourg and changed to an online format due to the COVID-19 pandemic. The total of 41 full papers presented in the proceedings was carefully reviewed and selected from 141 submissions. The volume also contains 7 tool papers; 6 Tool Demo papers, 9 SV-Comp Competition Papers. The papers are organized in topical sections as follows: Part I: Game Theory; SMT Verification; Probabilities; Timed Systems; Neural Networks; Analysis of Network Communication. Part II: Verification Techniques (not SMT); Case Studies; Proof Generation/Validation; Tool Papers; Tool Demo Papers; SV-Comp Tool Competition Papers

K-State graduate catalog, 1997-1999

Course catalogs were published under the following titles: Catalogue of the officers and students of the Kansas State Agricultural College, with a brief history of the institution, 1st (1863/4); Annual catalogue of the officers and students of the Kansas State Agricultural College for, 2nd (1864/5)-4th (1868/9); Catalogue of the officers and students of the Kansas State Agricultural College for the year, 1869-1871/2; Hand-book of the Kansas State Agricultural College, Manhattan, Kansas, 1873/4; Biennial catalogue of the Kansas State Agricultural College, Manhattan, Kansas, calendar years, 1875/77; Catalogue of the State Agricultural College of Kansas, 1877/80-1896/97; Annual catalogue of the officers, students and graduates of the Kansas State Agricultural College, Manhattan, 35th (1897/98)-46th (1908/09); Catalogue, 47th (1909/10)-67th (1929/30); Complete catalogue number, 68th (1930/31)-81st (1943/1944); Catalogue, 1945/1946-1948/1949?; General catalogue, 1949/1950?-1958/1960; General catalog, 1960/1962-1990/1992. Course catalogs then split into undergraduate and graduate catalogs respectively: K-State undergraduate catalog, 1992/1994- ; K-State graduate catalog, 1993/1995-Citation: Kansas State University. (1997). K-State graduate catalog, 1997-1999. Manhattan, KS: Kansas State University.Call number: LD2668.A11711 K78