| 000 | 01366cam a2200337Ia 4500 | ||
|---|---|---|---|
| 001 | u4829 | ||
| 003 | SA-PMU | ||
| 005 | 20210418124850.0 | ||
| 008 | 110729s2011 ml a b 101 0 eng d | ||
| 040 |
_aVYR _cVYR _dYDXCP |
||
| 020 | _a9781450306911 | ||
| 020 | _a1450306918 | ||
| 035 | _a(OCoLC)743303049 | ||
| 090 |
_aQA 76.6 _b.A152 2011 |
||
| 111 | 2 |
_aACM Symposium on Theory of Computing _n(43d : _d2011 : _cSan Jose, California) |
|
| 245 | 1 | 0 |
_aSTOC '11 : _bproceedings of the 2011 ACM international symposium on theory of computing, San Jose, California USA, June 6-8 2011 / _csponsored by ACM SIGACT ; additional support from Microsoft Research, Google and IBM. |
| 246 | 3 | 0 | _aACM international Symposium on Theory of Computing |
| 260 |
_aNew York, N. Y. : _bAssociation for Computing Machinery, _cc2011. |
||
| 300 |
_axv, 824 p. : _bill. ; _c28 cm. |
||
| 504 | _aIncludes bibliographical references and index. | ||
| 650 | 0 |
_aElectronic digital computers _vCongresses. |
|
| 650 | 0 |
_aElectronic data processing _vCongresses. |
|
| 650 | 0 |
_aComputer programming _vCongresses. |
|
| 650 | 0 |
_aComputational complexity _vCongresses. |
|
| 710 | 2 | _aACM Special Interest Group for Algorithms and Computation Theory. | |
| 710 | 2 | _aMicrosoft Research. | |
| 710 | 2 | _aAssociation for Computing Machinery. | |
| 942 | _cBOOK | ||
| 994 |
_aZ0 _bSUPMU |
||
| 596 | _a1 | ||
| 999 |
_c10101 _d10101 |
||