Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference最新文献

Resource-bounded genericity Resource-bounded genericity

Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference Pub Date : 1995-06-19 DOI: 10.1109/SCT.1995.514855

K. Ambos-Spies

引用次数: 36

Weighted NP optimization problems: logical definability and approximation properties 加权NP优化问题:逻辑可定义性和近似性质

Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference Pub Date : 1995-06-19 DOI: 10.1109/SCT.1995.514724

Marius Zimand

引用次数: 20

A game-theoretic classification of interactive complexity classes 交互复杂性类的博弈论分类

Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference Pub Date : 1995-06-19 DOI: 10.1109/SCT.1995.514861

J. Feigenbaum, D. Koller, P. Shor

{"title":"A game-theoretic classification of interactive complexity classes","authors":"J. Feigenbaum, D. Koller, P. Shor","doi":"10.1109/SCT.1995.514861","DOIUrl":"https://doi.org/10.1109/SCT.1995.514861","url":null,"abstract":"Game-theoretic characterisations of complexity classes have often proved useful in understanding the power and limitations of these classes. One well-known example tells us that PSPACE can be characterized by two-person, perfect-information games in which the length of a played game is polynomial in the length of the description of the initial position [by Chandra et al., see Journal of the ACM, vol. 28, p. 114-33 (1981)]. In this paper, we investigate the connection between game theory and interactive computation. We formalize the notion of a polynomially definable game system for the language L, which, informally, consists of two arbitrarily powerful players P/sub 1/ and P/sub 2/ and a polynomial-time referee V with a common input w. Player P/sub 1/ claims that w/spl isin/L, and player P/sub 2/ claims that w/spl isin/L; the referee's job is to decide which of these two claims is true. In general, we wish to study the following question: What is the effect of varying the system's game-theoretic properties on the class of languages recognizable by polynomially definable game systems? There are many possible game-theoretic properties that we could investigate in this context. The focus of this paper is the question of what happens when one or both of the players P/sub 1/ and P/sub 2/ have imperfect information or imperfect recall. We use polynomially definable game systems to derive new characterizations of the complexity classes NEXP and coNEXP.","PeriodicalId":318382,"journal":{"name":"Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference","volume":"145 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132059269","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 47

A note on genericity and bi-immunity 关于泛型和双豁免的说明

Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference Pub Date : 1995-06-19 DOI: 10.1109/SCT.1995.514857

J. Balcázar, E. Mayordomo

引用次数: 16

Towards average-case complexity analysis of NP optimization problems NP优化问题的平均情况复杂度分析

Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference Pub Date : 1995-06-19 DOI: 10.1109/SCT.1995.514854

R. Schuler, O. Watanabe

引用次数: 17

On finding the number of graph automorphisms 关于求图自同构的数目

Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference Pub Date : 1995-06-19 DOI: 10.1109/SCT.1995.514867

R. Beals, Richard Chang, W. Gasarch, J. Torán

引用次数: 17

Decision trees with AND, OR queries 带有AND或查询的决策树

Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference Pub Date : 1995-06-19 DOI: 10.1109/SCT.1995.514729

Y. Ben-Asher, I. Newman

引用次数: 6

Resource-bounded Baire category: a stronger approach 资源有限的贝尔类别:一个更强的方法

Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference Pub Date : 1995-06-19 DOI: 10.1109/SCT.1995.514856

Stephen A. Fenner

引用次数: 10

On approximation algorithms for hierarchical MAX-SAT 关于分层MAX-SAT的近似算法

Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference Pub Date : 1995-06-19 DOI: 10.1109/SCT.1995.514860

Sameet Agarwal, A. Condon

{"title":"On approximation algorithms for hierarchical MAX-SAT","authors":"Sameet Agarwal, A. Condon","doi":"10.1109/SCT.1995.514860","DOIUrl":"https://doi.org/10.1109/SCT.1995.514860","url":null,"abstract":"We prove upper and lower bounds on performance guarantees of approximation algorithms for the hierarchical MAX-SAT (H-MAX-SAT) problem. This problem is representative of an important class of PSPACE-hard problems involving graphs, Boolean formulas and other structures that are defined \"succinctly\". Our first result is that for some constant /spl epsiv/<1, it is PSPACE-hard to approximate the function H-MAX-SAT to within ratio /spl epsiv/. We obtain our result using a known characterization of PSPACE in terms of probabilistically checkable debate systems. As an immediate application, we obtain non-approximability results for functions on hierarchical graphs by combining our result with previously known approximation-preserving reductions to other problems. For example, it is PSPACE-hard to approximate H-MAX-CUT and H-MAX-INDEPENDENT-SET to within some constant factor. Our second result is that there is an efficient approximation algorithm for H-MAX-SAT with performance guarantee 2/3. The previous best bound claimed for this problem was 1/2. One new technique of our algorithm can be used to obtain approximation algorithms for other problems, such as hierarchical MAX-CUT, which are simpler than previously known algorithms and which have performance guarantees that match the previous best bounds.","PeriodicalId":318382,"journal":{"name":"Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130150794","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 10

Inverting the Turing jump in complexity theory 颠覆复杂性理论中的图灵跳跃

Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference Pub Date : 1995-06-19 DOI: 10.1109/SCT.1995.514732

Stephen A. Fenner

{"title":"Inverting the Turing jump in complexity theory","authors":"Stephen A. Fenner","doi":"10.1109/SCT.1995.514732","DOIUrl":"https://doi.org/10.1109/SCT.1995.514732","url":null,"abstract":"The paper investigates the invertibility of certain analogs of the Turing jump operator in the polynomial-time Turing degrees. If /spl Cscr/ is some complexity class, the /spl Cscr/-jump of a set A is the canonical /spl Cscr/-complete set relative to A. It is shown that the PSPACE-jump and EXP-jump operators are not invertible, i.e., there is a PSPACE-hard (resp. EXP-hard) set that is not p-time Turing equivalent to the PSPACE-jump (resp. EXP-jump) of any set. It is also shown that if PH collapses to /spl Sigma//sub k//sup p/, then the /spl Sigma//sub k//sup p/-jump is not invertible. In particular, if NP=co-NP, then the NP-jump is not invertible, witnessed, in particular, by G/spl oplus/SAT, where G is any 1-generic set. These results run contrary to the Friedberg (1957) Completeness Criterion in recursion theory, which says that every (recursive) Turing degree above 0' is the Turing jump of another degree. The sets used in the paper to witness /spl Cscr/-jump noninvertibility are all of the form G/spl oplus/C, cohere G is 1-generic and C is some /spl Cscr/-complete set. Other facts regarding 1-generics G and G/spl oplus/SAT are also explored. In particular, G always lies in NP/sup A/-P/sup A/ for some A/spl les/G/sub tt//sup P/, but if A/spl les//sub /spl oplus/P-tt//sup p/ G/sub /spl oplus//SAT/spl les//sub T//sup P/SAT/sup A/ for some A, then G/spl les//sub T//sup P/A/spl oplus/SAT, which in turn implies either G/spl les//sub T//sup P/ A or P/spl ne/NP.","PeriodicalId":318382,"journal":{"name":"Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134010410","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 2