The approximability of problems complete for P [C.T.I. Technical Report] TR. 89.02.74
| Main Authors: | Serna, Maria, 1959- (Author), Σπυράκης, Παύλος Γ. (Author) |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
[Πάτρα Ελλάδα] Patras Greece
Ινστιτούτο Τεχνολογίας Υπολογιστών Computer Technology Institute
1989 1989
|
| Subjects: |
Similar Items
-
Approximating Linear Programming is log-space complete for P C.T.I. Technical Report TR.89.10.98
by: Serna, Maria, 1959-
Published: (1989) -
Testing Whether a Graph has a Nontrivial 3-Connected Subgraph is P-Complete Under NC1 Reductions CTI Technical Report TR 76.2.89 [89.2.76]
by: Serna, Maria, 1959-, et al.
Published: (1989) -
Fast Soliton Automata. C.T.I. Technical Report TR. 89.05.89
by: Παπαθεοδώρου, Θεόδωρος Π., et al.
Published: (1989) -
The Parallel Complexity of the Subgraph Connectivity Problem C.T.I. [Technical Report] TR. 89.04.82
by: Serna, Maria, 1959-, et al.
Published: (1989) -
Prototype Environment for Teaching Program Design by Exercises [C.T.I.] Technical Report TR. 89.02.75
by: Comar, Cyrille, et al.
Published: (1989)