The following pages link to (Q4910734):
Displaying 8 items.
- Relation between the hardness of a problem and the number of its solutions (Q540772) (← links)
- Complexity of equations over sets of natural numbers (Q633764) (← links)
- Conjunctive grammars with restricted disjunction (Q974750) (← links)
- Computational completeness of equations over sets of natural numbers (Q2252522) (← links)
- Polynomial-space decidable membership problems for recurrent systems over sets of natural numbers (Q2642916) (← links)
- One-Nonterminal Conjunctive Grammars over a Unary Alphabet (Q3392954) (← links)
- Functions Definable by Arithmetic Circuits (Q3576073) (← links)
- Conjunctive Grammars with Restricted Disjunction (Q3599090) (← links)