If you are experiencing problems downloading PDF or HTML fulltext, our helpdesk recommend clearing your browser cache and trying again. If you need help in clearing your cache, please click here . Still need help? Email help@ingentaconnect.com

Publisher: Elsevier

Related content
Volume 62, Number 4, 28 May 1997

< previous issue | all issues | next issue >

Favourites:Add to Favourites

The strong equivalence of ETOL grammars
pp. 171-176(6)
Authors: L; Istrate, G.

Favourites:Add to Favourites

Cancellation is exponentially powerful for computing the determinant
pp. 177-181(5)
Authors: Barletta, A.; F; Sengupta, R.

Favourites:Add to Favourites

Unification for infinite sets of equations between finite terms
pp. 183-188(6)
Authors: Homan, K.O.; Soo, S.L.; H; Fokkink, W.

Favourites:Add to Favourites

Maintaining transitive closure in first order after node-set and edge-set deletions
pp. 193-199(7)
Authors: Yamada, M.; Fukusako, S.; Kawanami, T.; Watanabe, C.; R; Guozhu, D.; Chaoyi, P.

Favourites:Add to Favourites

Node-to-set disjoint paths problem in star graphs
pp. 201-207(7)
Authors: Angelucci, N.; Bianco, N.; Manca, O.; S; Gu Q.-P.; Shietung, P.

Favourites:Add to Favourites

Complexity and dimension
pp. 209-212(4)
Authors: Lin, L.; Faghri, A.; P; Cucker, F.; Koiran, P.; Matamala, M.

Favourites:Add to Favourites

Average competitive ratios of on-line spanning trees
pp. 213-216(4)
Authors: Seyedein, S.H.; Hasan, M.; P; Feng, B.; Aohan, M.; Igarashi, Y.

Favourites:Add to Favourites

A polynomial-time algorithm for knapsack with divisible item sizes
pp. 217-221(5)
Authors: Costa, V.A.F.; T; Verhaegh, W.F.J.; Aarts, E.H.L.

Share Content

Access Key

Free Content
Free content
New Content
New content
Open Access Content
Open access content
Subscribed Content
Subscribed content
Free Trial Content
Free trial content
Cookie Policy
X
Cookie Policy
ingentaconnect website makes use of cookies so as to keep track of data that you have filled in. I am Happy with this Find out more