ACM SIGACT News
The inapproximability of non-NP-hard optimization problems
Theoretical Computer Science
On interacting automata with limited nondeterminism
Fundamenta Informaticae - Special issue on cellular automata
On the Complexity and Inapproximability of Shortest Implicant Problems
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
The Inapproximability of Non NP-hard Optimization Problems
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Refining nondeterminism below linear time
Journal of Automata, Languages and Combinatorics - Third international workshop on descriptional complexity of automata, grammars and related structures
The intractability of computing the Hamming distance
Theoretical Computer Science
Simplifying the weft hierarchy
Theoretical Computer Science - Parameterized and exact computation
Context-dependent nondeterminism for pushdown automata
Theoretical Computer Science
Inductive Time-Space Lower Bounds for Sat and Related Problems
Computational Complexity
Improving exhaustive search implies superpolynomial lower bounds
Proceedings of the forty-second ACM symposium on Theory of computing
Balanced queries: divide and conquer
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
On the Compressibility of $\mathcal{NP}$ Instances and Cryptographic Applications
SIAM Journal on Computing
Fixed-parameter approximation: conceptual framework and approximability results
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Context-Dependent nondeterminism for pushdown automata
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Parameterized complexity and subexponential-time computability
The Multivariate Algorithmic Revolution and Beyond
On Interacting Automata with Limited Nondeterminism
Fundamenta Informaticae - Cellular Automata
| Hi-index | 0.00 |
The relationship between nondeterminism and other computational resources is investigated based on the "guess-then-check" model GC. Systematic techniques are developed to construct natural complete languages for the classes defined by this model. This improves a number of previous results in the study of limited nondeterminism. Connections of the model GC to computational optimization problems are exhibited.