Limited nondeterminism
暂无分享,去创建一个
[1] Laura A. Sanchis. Constructing Language Instances Based on Partial Information , 1994, Int. J. Found. Comput. Sci..
[2] Lane A. Hemaspaandra,et al. Defying Upward and Downward Separation , 1993, Inf. Comput..
[3] Vikraman Arvind,et al. On Bounded Truth-Table, Conjunctive, and Randomized Reductions to Sparse Sets , 1992, FSTTCS.
[4] Stephen A. Bloch,et al. How Hard Are n 2-Hard Problems ? , 1994 .
[5] Mihalis Yannakakis,et al. On limited nondeterminism and the complexity of the V-C dimension , 1993, [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference.
[6] Ronald V. Book,et al. Tally Languages and Complexity Classes , 1974, Inf. Control..
[7] Moni Naor,et al. Decision trees and downward closures , 1988, [1988] Proceedings. Structure in Complexity Theory Third Annual Conference.
[8] R. Downey,et al. Parameterized Computational Feasibility , 1995 .
[9] Jonathan Goldstine,et al. On the Relation between Ambiguity and Nondeterminism in Finite Automata , 1992, Inf. Comput..
[10] Jacobo Torán,et al. Complexity Classes with Complete Problems Between P and NP-C , 1989, FCT.
[11] Richard Beigel,et al. Downward separation fails catastrophically for limited nondeterminism classes , 1994, Computational Complexity Conference.
[12] Detlef Wotschke,et al. Amounts of nondeterminism in finite automata , 1980, Acta Informatica.
[13] Imre Simon. The Nondeterministic Complexity of a Finite Automaton , 1987 .
[14] Robert Szelepcs enyi. \beta_k-Complete Problems and Greediness , 1993 .
[15] Vaughan R. Pratt,et al. Every Prime has a Succinct Certificate , 1975, SIAM J. Comput..
[16] Jonathan Goldstine,et al. On Measuring Nondeterminism in Regular Languages , 1990, Inf. Comput..
[17] Liming Cai,et al. On Fixed-Parameter Tractability and Approximability of NP Optimization Problems , 1997, J. Comput. Syst. Sci..
[18] Mihalis Yannakakis,et al. Optimization, approximation, and complexity classes , 1991, STOC '88.
[19] Michael R. Fellows,et al. Fixed-parameter intractability , 1992, [1992] Proceedings of the Seventh Annual Structure in Complexity Theory Conference.
[20] Hing Leung. On finite automata with limited nondeterminism , 1998, Acta Informatica.
[21] J. Hartmanis,et al. On the Computational Complexity of Algorithms , 1965 .
[22] Ker-I Ko,et al. On Helping by Robust Oracle Machines , 1987, Theor. Comput. Sci..
[23] A. R. Meyer,et al. Economy of Description by Automata, Grammars, and Formal Systems , 1971, SWAT.
[24] Stephen A. Bloch,et al. Sharply Bounded Alternation within P , 1996, DMTCS.
[25] Patrick C. Fischer,et al. Computations with a restricted number of nondeterministic steps (Extended Abstract) , 1977, STOC '77.
[26] Marty J. Wolf. Nondeterministic Circuits, Space Complexity and Quasigroups , 1994, Theor. Comput. Sci..
[27] Liming Cai,et al. On the Structure of Parameterized Problems in NP , 1995, Inf. Comput..
[28] Stephen A. Bloch,et al. How hard are n2-hard problems? , 1994, SIGA.
[29] Dirk Vermeir,et al. On the amount of non-determinism in pushdown in pushdown automata , 1981, Fundam. Informaticae.
[30] Ildar R. Nasyrov. The Degrees of Nondeterminism in Pushdown Automata , 1987, FCT.
[31] Judy Goldsmith,et al. Nondeterminism Within P , 1993, SIAM J. Comput..
[32] Liming Cai,et al. On the Amount of Nondeterminism and the Power of Verifying , 1997, SIAM J. Comput..