Volume 62; Issue 4

Information Processing Letters

Volume 62; Issue 4
1

Node-to-set disjoint paths problem in star graphs

Year:
1997
Language:
english
File:
PDF, 567 KB
english, 1997
2

Complexity and dimension

Year:
1997
Language:
english
File:
PDF, 313 KB
english, 1997
3

A polynomial-time algorithm for knapsack with divisible item sizes

Year:
1997
Language:
english
File:
PDF, 369 KB
english, 1997
4

Unification for infinite sets of equations between finite terms

Year:
1997
Language:
english
File:
PDF, 535 KB
english, 1997
5

Average competitive ratios of on-line spanning trees

Year:
1997
Language:
english
File:
PDF, 284 KB
english, 1997
8

The strong equivalence of ET0L grammars

Year:
1997
Language:
english
File:
PDF, 444 KB
english, 1997
9

Cancellation is exponentially powerful for computing the determinant

Year:
1997
Language:
english
File:
PDF, 500 KB
english, 1997