000 01571nam a22004335i 4500
001 u373944
003 SIRSI
005 20160812084210.0
007 cr nn 008mamaa
008 110609s2011 gw | s |||| 0|eng d
020 _a9783642111204
_9978-3-642-11120-4
040 _cMX-MeUAM
050 4 _aQA402-402.37
050 4 _aT57.6-57.97
082 0 4 _a519.6
_223
100 1 _aPreparata, F.
_eeditor.
245 1 0 _aTheoretical Computer Science
_h[recurso electrónico] /
_cedited by F. Preparata.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2011.
300 _a184p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aC.I.M.E. Summer Schools ;
_v68
520 _aR.E. Miller: Parallel program schemata.- D.E. Muller: Theory of automata.- R. Karp: Computational complexity of combinatorial and graph-theoretic problems.
650 0 _aMathematics.
650 0 _aInformation theory.
650 1 4 _aMathematics.
650 2 4 _aOperations Research, Management Science.
650 2 4 _aTheory of Computation.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783642111181
830 0 _aC.I.M.E. Summer Schools ;
_v68
856 4 0 _zLibro electrónico
_uhttp://148.231.10.114:2048/login?url=http://link.springer.com/book/10.1007/978-3-642-11120-4
596 _a19
942 _cLIBRO_ELEC
999 _c201824
_d201824