Fast Parallel Approximations of the Maximum Weighted Cut Problem through Derandomization. C.T.I. Technical Report TR 89.04.83

Παρόμοια τεκμήρια

• Fast Soliton Automata. C.T.I. Technical Report TR. 89.05.89
  ανά: Παπαθεοδώρου, Θεόδωρος Π., κ.ά.
  Έκδοση: (1989)
• The approximability of problems complete for P [C.T.I. Technical Report] TR. 89.02.74
  ανά: Serna, Maria, 1959-, κ.ά.
  Έκδοση: (1989)
• The Parallel Complexity of the Subgraph Connectivity Problem C.T.I. [Technical Report] TR. 89.04.82
  ανά: Serna, Maria, 1959-, κ.ά.
  Έκδοση: (1989)
• Approximating Linear Programming is log-space complete for P C.T.I. Technical Report TR.89.10.98
  ανά: Serna, Maria, 1959-
  Έκδοση: (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]
  ανά: Serna, Maria, 1959-, κ.ά.
  Έκδοση: (1989)