Proceedings of the ...ACM Symposium on Theory of Computing, Volume 31

Front Cover
0 Reviews

From inside the book

What people are saying - Write a review

We haven't found any reviews in the usual places.

Related books

Contents

A Polynomial Combinatorial Algorithm for Generalized Minimum Cost Flow
11
NearOptimal Hardness Results and Approximation Algorithms for EdgeDisjoint Paths
19
Session
29
Copyright

33 other sections not shown

Other editions - View all

Common terms and phrases

References from web pages

Proceedings of the thirty-first annual ACM symposium on Theory of ...
Proceedings of the thirty-first annual ACM symposium on Theory of computing ... Proceedings of the thirty-first annual ACM symposium on Theory of computing ...
portal.acm.org/ citation.cfm?id=301250

STOC
Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, May 1-4, 1999, Atlanta, Georgia, USA. ACM, 1999 ...
www.informatik.uni-trier.de/ ~ley/ db/ conf/ stoc/

COS 597E, Fall 2003: Home Page
In Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, pages 659 667, 1999. N. Nisan and A. Wigderson. Hardness vs. randomness. ...
www.cs.princeton.edu/ courses/ archive/ fall03/ cs597E/

-*-bibtex ...
%%% -*-bibtex-*- %%% ========================================================== ========== %%% bibtex-file{ %%% author = "Nelson hf Beebe", ...
www.math.utah.edu/ pub/ tex/ bib/ stoc.bib

Catálogo - ACM Symposium on Theory of Computing (31º : 1999 ...
Proceedings of the thirty-first annual ACM Symposium on Theory of Computing : Atlanta, Georgia, May 1-4, 1999. sponsored by the ACM Special Interest Group ...
catalis.uns.edu.ar/ cgi-bin/ catalis_pack_demo_devel/ wxis?IsisScript=opac/ xis/ opac.xis& db=bibima& task=BIB-H-SEARCH& ind...

Bibliographic information