On helping by robust oracle machines
Theoretical Computer Science
On measuring nondeterminism in regular languages
Information and Computation
SIAM Journal on Computing
On the relation between ambiguity and nondeterminism in finite automata
Information and Computation
How hard are n2-hard problems?
ACM SIGACT News
Nondeterministic circuits, space complexity and quasigroups
Theoretical Computer Science
Defying upward and downward separation
Information and Computation
On the Amount of Nondeterminism and the Power of Verifying
SIAM Journal on Computing
On fixed-parameter tractability and approximability of NP optimization problems
Journal of Computer and System Sciences - special issue on complexity theory
On Finite Automata with Limited Nondeterminism
MFCS '92 Proceedings of the 17th International Symposium on Mathematical Foundations of Computer Science
On Bounded Truth-Table, Conjunctive, and Randomized Reductions to Sparse Sets
Proceedings of the 12th Conference on Foundations of Software Technology and Theoretical Computer Science
Complexity Classes with Complete Problems Between P and NP-C
FCT '89 Proceedings of the International Conference on Fundamentals of Computation Theory
Degrees of Nondeterminism for Pushdown Automata
FCT '91 Proceedings of the 8th International Symposium on Fundamentals of Computation Theory
\beta_k-Complete Problems and Greediness
\'beta_k-Complete Problems and Greediness
Computations with a restricted number of nondeterministic steps.
Computations with a restricted number of nondeterministic steps.
New results on monotone dualization and generating hypergraph transversals
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
The inapproximability of non-NP-hard optimization problems
Theoretical Computer Science
Monotone boolean dualization is in co-NP[log2n]
Information Processing Letters
The Inapproximability of Non NP-hard Optimization Problems
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Hypergraph Transversal Computation and Related Problems in Logic and AI
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
Refining nondeterminism below linear time
Journal of Automata, Languages and Combinatorics - Third international workshop on descriptional complexity of automata, grammars and related structures
Space- and time-bounded nondeterminism for cellular automata
Fundamenta Informaticae - Special issue on cellular automata
Context-dependent nondeterminism for pushdown automata
Theoretical Computer Science
Computational aspects of monotone dualization: A brief survey
Discrete Applied Mathematics
Towards the Complexity of Recognizing Pseudo-intents
ICCS '09 Proceedings of the 17th International Conference on Conceptual Structures: Conceptual Structures: Leveraging Semantic Technologies
Regulated nondeterminism in pushdown automata
Theoretical Computer Science
Regulated nondeterminism in pushdown automata
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
On the Compressibility of $\mathcal{NP}$ Instances and Cryptographic Applications
SIAM Journal on Computing
The complexity of manipulative attacks in nearly single-peaked electorates
Proceedings of the 13th Conference on Theoretical Aspects of Rationality and Knowledge
Nondeterministic graph searching: from pathwidth to treewidth
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Context-Dependent nondeterminism for pushdown automata
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
The complexity of quasigroup isomorphism and the minimum generating set problem
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Space- and Time-Bounded Nondeterminism for Cellular Automata
Fundamenta Informaticae - Cellular Automata
Deciding monotone duality and identifying frequent itemsets in quadratic logspace
Proceedings of the 32nd symposium on Principles of database systems
Graph Isomorphism is Not AC0-Reducible to Group Isomorphism
ACM Transactions on Computation Theory (TOCT)
The complexity of manipulative attacks in nearly single-peaked electorates
Artificial Intelligence
| Hi-index | 0.00 |
Yes, the lucky 13th column is here, and it is a guest column written by J. Goldsmith, M. Levy, and M. Mundhenk on the topic of limited nondeterminism---classes and hierarchies derived when nondeterminism itself is viewed as a quantifiable resource (as it indeed is!).Coming up in the Complexity Theory Column in the very special 100th issue of SIGACT News: A forum on the future of complexity theory. Many of the field's leading lights share their exciting insights on what lies ahead, so please be there in three!