Date 20-22 Oct. 1997
Filter Results
Displaying Results 1 - 25 of 65
-
Proceedings 38th Annual Symposium on Foundations of Computer Science
|
PDF (277 KB)
-
Author index
|
PDF (94 KB)
-
-
-
On the power of quantum finite state automata
|
PDF (816 KB)
-
-
-
-
-
Separation of the monotone NC hierarchy
|
PDF (864 KB)
-
-
Parallelizing elimination orders with linear fill
|
PDF (1080 KB)
-
-
-
New directions in cryptography: twenty some years later (or cryptograpy and complexity theory: a match made in heaven)
|
PDF (836 KB)
-
Beyond the flow decomposition barrier
|
PDF (832 KB)
-
Making nondeterminism unambiguous
|
PDF (776 KB)
-
Improved approximations for edge-disjoint paths, unsplittable flow, and related routing problems
|
PDF (872 KB)
-
-
Buy-at-bulk network design
|
PDF (452 KB)
-
-
Flows in undirected unit capacity networks
|
PDF (252 KB)
-
-
-
The minimization problem for Boolean formulas
|
PDF (680 KB)


