Algorithms and Computation: 5th International Symposium, ISAAC '94, Beijing, P.R
121,58 €
Polynomial equations-solving and its applications. - Quasi-random combinatorial structures. - On random hard sets for NP. - Hardness of approximating graph transformation problem. - Randomized wait-free naming.
Jetzt bei Ebay:
