General polynomial decomposition and the s-1-decomposition are NP-Hard.
- Published in:
- International Journal of Foundations of Computer Science, 1993, v. 4, n. 2, p. 147, doi. 10.1142/S0129054193000109
- By:
- Publication type:
- Article
Works matching IS 01290541 AND DT 1993 AND VI 4 AND IP 2
Results: 6
1
2
ON THE EQUIVALENCE OF TWO-WAY PUSHDOWN AUTOMATA AND COUNTER MACHINES OVER BOUNDED LANGUAGES.
- Published in:
- International Journal of Foundations of Computer Science, 1993, v. 4, n. 2, p. 135, doi. 10.1142/S0129054193000092
- By:
- Publication type:
- Article
3
SCHEDULING FILE TRANSFERS UNDER PORT AND CHANNEL CONSTRAINTS.
- Published in:
- International Journal of Foundations of Computer Science, 1993, v. 4, n. 2, p. 101, doi. 10.1142/S0129054193000079
- By:
- Publication type:
- Article
4
PARALLEL ALGORITHMS FOR FINDING MAXIMAL k-DEPENDENT SETS AND MAXIMAL f-MATCHINGS.
- Published in:
- International Journal of Foundations of Computer Science, 1993, v. 4, n. 2, p. 179, doi. 10.1142/S0129054193000122
- By:
- Publication type:
- Article
5
ON TWO APPROXIMATION ALGORITHMS FOR THE CLIQUE PROBLEM.
- Published in:
- International Journal of Foundations of Computer Science, 1993, v. 4, n. 2, p. 117, doi. 10.1142/S0129054193000080
- By:
- Publication type:
- Article
6
LEARNING RECURSIVE LANGUAGES WITH BOUNDED MIND CHANGES.
- Published in:
- International Journal of Foundations of Computer Science, 1993, v. 4, n. 2, p. 157, doi. 10.1142/S0129054193000110
- By:
- Publication type:
- Article