Graph Complexity and Slice Functions.
- Published in:
- Theory of Computing Systems, 2003, v. 36, n. 1, p. 71, doi. 10.1007/s00224-002-1068-0
- By:
- Publication type:
- Article
Works matching IS 14324350 AND DT 2003 AND VI 36 AND IP 1
Results: 5
1
2
The Equivalence Problem of Polynomially Bounded D0L Systems— a Bound Depending Only on the Size of the Alphabet.
- Published in:
- Theory of Computing Systems, 2003, v. 36, n. 1, p. 89, doi. 10.1007/s00224-002-1075-1
- By:
- Publication type:
- Article
3
An Efficient Algorithm for Finding All Hinge Vertices on Trapezoid Graphs.
- Published in:
- Theory of Computing Systems, 2003, v. 36, n. 1, p. 17, doi. 10.1007/s00224-002-1004-3
- By:
- Publication type:
- Article
4
Regular Languages Defined by Generalized First-Order Formulas with a Bounded Number of Bound Variables.
- Published in:
- Theory of Computing Systems, 2003, v. 36, n. 1, p. 29, doi. 10.1007/s00224-002-1035-9
- By:
- Publication type:
- Article
5
Polynomial Time Introreducibility.
- Published in:
- Theory of Computing Systems, 2003, v. 36, n. 1, p. 1, doi. 10.1007/s00224-002-1040-z
- By:
- Publication type:
- Article