Volume 24; Issue 5

SIAM Journal on Computing

Volume 24; Issue 5
1

Polynomial-Time Membership Comparable Sets

Ogihara, Mitsunori
Journal:
SIAM Journal on Computing
Year:
1995
Language:
english
File:
PDF, 1.99 MB
english, 1995
2

With Quasilinear Queries EXP Is Not Polynomial Time Turing Reducible to Sparse Sets

Fu, Bin
Journal:
SIAM Journal on Computing
Year:
1995
Language:
english
File:
PDF, 1005 KB
english, 1995
3

New Tight Bounds on Uniquely Represented Dictionaries

Andersson, Arne, Ottmann, Thomas
Journal:
SIAM Journal on Computing
Year:
1995
Language:
english
File:
PDF, 1.56 MB
english, 1995
4

Scheduling Jobs with Temporal Distance Constraints

Han, Ching-Chih, Lin, Kwei-Jay, Liu, Jane W.-S.
Journal:
SIAM Journal on Computing
Year:
1995
Language:
english
File:
PDF, 2.60 MB
english, 1995
5

On the Approximation of Shortest Common Supersequences and Longest Common Subsequences

Jiang, Tao, Li, Ming
Journal:
SIAM Journal on Computing
Year:
1995
Language:
english
File:
PDF, 2.23 MB
english, 1995
6

Flow in Planar Graphs with Multiple Sources and Sinks

Miller, Gary L., Naor, Joseph (Seffi)
Journal:
SIAM Journal on Computing
Year:
1995
Language:
english
File:
PDF, 2.32 MB
english, 1995
7

A Subexponential Algorithm for Abstract Optimization Problems

Gärtner, Bernd
Journal:
SIAM Journal on Computing
Year:
1995
Language:
english
File:
PDF, 2.07 MB
english, 1995
9

Minimum Cost Paths in Periodic Graphs

Höfting, Franz, Wanke, Egon
Journal:
SIAM Journal on Computing
Year:
1995
Language:
english
File:
PDF, 1.65 MB
english, 1995
10

Computational Complexity of Two-Dimensional Regions

Chou, Arthur W., Ko, Ker-I
Journal:
SIAM Journal on Computing
Year:
1995
Language:
english
File:
PDF, 3.31 MB
english, 1995
11

Nearly Optimal Algorithms for Canonical Matrix Forms

Giesbrecht, Mark
Journal:
SIAM Journal on Computing
Year:
1995
Language:
english
File:
PDF, 2.82 MB
english, 1995