信息与控制最新文献_第4页

A decisive characterization of BPP BPP的决定性特征

信息与控制 Pub Date : 1986-04-01 DOI: 10.1016/S0019-9958(86)80044-4

Stathis Zachos, Hans Heller

{"title":"A decisive characterization of BPP","authors":"Stathis Zachos, Hans Heller","doi":"10.1016/S0019-9958(86)80044-4","DOIUrl":"10.1016/S0019-9958(86)80044-4","url":null,"abstract":"<div>The complexity class BPP (defined by Gill) contains problems that can be solved in polynomial time with bounded error probability. A new and simple characterization of BPP is given. It is shown that a language L is in BPP iff (x ∈ L → ∃+y∀zP(x, y, z)) ∧ (x ∉ L → ∀y∃+ z ¬ P(x, y, z)) for a polynomial-time predicate P and for |y|, |z| ⩽ poly (|x|). The formula ∃+ yP(y) with the random quantifier ∃+ means that the probability Pr({y|P(y)}) ⩾+ ɛ for a fixed ɛ. This characterization allows a simple proof that BPP ⊆ ZPPNP, which strengthens the result of (Lautemann, Inform. Process. Lett. 17 (1983), 215–217; Sipser, in “Proceedings, 15th Annu. ACM Sympos. Theory of Comput.,” 1983, pp. 330–335) that BPP ⊆ Σ2p ∩ Π2p. Several other results about probabilistic classes can be proved using similar techniques, e.g., NPR ⊆ ZPPNP and Σ2p,BPP = Σ2p.</div>","PeriodicalId":38164,"journal":{"name":"信息与控制","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1986-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0019-9958(86)80044-4","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80997552","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 53

Machines for attribute grammars 用于属性语法的机器

信息与控制 Pub Date : 1986-04-01 DOI: 10.1016/S0019-9958(86)80043-2

Gilberto Filé

引用次数: 5

Sorting jordan sequences in linear time using level-linked search trees 排序约旦序列在线性时间使用水平链接搜索树

信息与控制 Pub Date : 1986-01-01 DOI: 10.1016/S0019-9958(86)80033-X

Kurt Hoffmann, Kurt Mehlhorn, Pierre Rosenstiehl, Robert E. Tarjan

引用次数: 121

The position of index sets of identifiable sets in the arithmetical hierarchy 可识别集的索引集在算术层次结构中的位置

信息与控制 Pub Date : 1986-01-01 DOI: 10.1016/S0019-9958(86)80034-1

Ulrike Brandt

引用次数: 9

A polynomial jump operator 多项式跳转算子

信息与控制 Pub Date : 1986-01-01 DOI: 10.1016/S0019-9958(86)80032-8

Mike Townsend

{"title":"A polynomial jump operator","authors":"Mike Townsend","doi":"10.1016/S0019-9958(86)80032-8","DOIUrl":"10.1016/S0019-9958(86)80032-8","url":null,"abstract":"<div>For recursive sets A, define a complexity theoretic version of the ordinary recursion theoretic jump by setting A′ equal to the canonical NPA-complete set. Thus A < PT A′ iff PA ≠ NPA. The nth jump, A(n), is defined by iteration. A jumps n times if A < PT A′ < PT… < PT A(n). It is straightforward that the jump operation is monotone. Post's theorem holds for the (relativized) polynomial hierarchy. We establish the following analogues of results in ordinary recursion theory: all relationships between pairs of polynomial Turing degrees and their jumps consistent with monotonicity can be realized by degrees which jump at least twice. For example, there are polynomially incomparable A and B with A′ ≡ PT B′. Moreover, if for each recursive D the set of E such that D join E jumps at least n times is effectively comeager, then these relationships can be realized by degrees jumping at least n times. We also relativize some well-known results by showing that if A′ is polynomially many-one reducible to the join of A and a (co-)sparse set, then PA = NPA; and if A′ is polynomially Turing reducible to the join of A and an NPA-(co-)sparse set, then the relativized polynomial hierarchy collapses to ΔP,A2.</div>","PeriodicalId":38164,"journal":{"name":"信息与控制","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1986-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0019-9958(86)80032-8","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78874070","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

Relational queries computable in polynomial time 关系查询可在多项式时间内计算

信息与控制 Pub Date : 1986-01-01 DOI: 10.1016/S0019-9958(86)80029-8

Neil Immerman

引用次数: 728

New upper bounds for neighbor searching 新的邻居搜索的上界

信息与控制 Pub Date : 1986-01-01 DOI: 10.1016/S0019-9958(86)80030-4

B. Chazelle , R. Cole , F.P. Preparata , C. Yap

引用次数: 19

A modal characterization of observational congruence on finite terms of CCS CCS有限项上观测同余的模态表征

信息与控制 Pub Date : 1986-01-01 DOI: 10.1016/S0019-9958(86)80031-6

S. Graf, J. Sifakis