The Operators min and max on the Polynomial Hierarchy
暂无分享,去创建一个
[1] Heribert Vollmer,et al. Uniformly Defining Complexity Classes of Functions , 1998, STACS.
[2] Larry J. Stockmeyer,et al. The Polynomial-Time Hierarchy , 1976, Theor. Comput. Sci..
[3] Mark W. Krentel. Generalizations of Opt P to the Polynomial Hierarchy , 1992, Theor. Comput. Sci..
[4] 戸田 誠之助,et al. Computational complexity of counting complexity classes , 1991 .
[5] Heribert Vollmer,et al. The Complexity of Finding Middle Elements , 1993, Int. J. Found. Comput. Sci..
[6] Klaus W. Wagner,et al. Some Observations on the Connection Between Counting an Recursion , 1986, Theor. Comput. Sci..
[7] Ioan I. Macarie. Space-bounded probabilistic computation: old and new stories , 1995, SIGA.
[8] Lane A. Hemachandra,et al. A complexity theory for feasible closure properties , 1993 .
[9] José L. Balcázar,et al. Structural Complexity II , 2012, EATCS.
[10] Leslie G. Valiant,et al. The Complexity of Computing the Permanent , 1979, Theor. Comput. Sci..
[11] William I. Gasarch,et al. OptP as the Normal Behavior of NP-Complete Problems , 1995, Math. Syst. Theory.
[12] Mihalis Yannakakis,et al. The complexity of facets (and some facets of complexity) , 1982, STOC '82.
[13] Heribert Vollmer,et al. Complexity Classes of Optimization Functions , 1995, Inf. Comput..
[14] Seinosuke Toda,et al. PP is as Hard as the Polynomial-Time Hierarchy , 1991, SIAM J. Comput..
[15] Zhi-Zhong Chen,et al. The complexity of selecting maximal solutions , 1993, [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference.
[16] Leslie G. Valiant,et al. The Complexity of Enumeration and Reliability Problems , 1979, SIAM J. Comput..
[17] Albert R. Meyer,et al. The Equivalence Problem for Regular Expressions with Squaring Requires Exponential Space , 1972, SWAT.
[18] Seinosuke Toda. Simple Characterizations of P(#P) and Complete Problems , 1994, J. Comput. Syst. Sci..
[19] Mark W. Krentel. The Complexity of Optimization Problems , 1988, J. Comput. Syst. Sci..
[20] Jacobo Torán,et al. On Counting and Approximation , 1988, CAAP.
[21] Heribert Vollmer,et al. The satanic notations , 1995, SIGACT News.
[22] C. Papadimitriou,et al. Two remarks on the power of counting , 1983 .
[23] José L. Balcázar,et al. Structural Complexity I , 1995, Texts in Theoretical Computer Science An EATCS Series.
[24] Klaus W. Wagner. More Complicated Questions About Maxima and Minima, and Some Closures of NP , 1987, Theor. Comput. Sci..