| Record ID | marc_loc_2016/BooksAll.2016.part38.utf8:149356875:1885 |
| Source | Library of Congress |
| Download Link | /show-records/marc_loc_2016/BooksAll.2016.part38.utf8:149356875:1885?format=raw |
LEADER: 01885cam a22004577a 4500
001 2010929188
003 DLC
005 20120516082310.0
008 100520s2010 gw a b 101 0 eng d
010 $a 2010929188
015 $a10,N21$2dnb
016 7 $a1002680492$2DE-101
020 $a9783642139611 (pbk. : alk. paper)
020 $a3642139612 (pbk. : alk. paper)
035 $a(OCoLC)ocn646006859
040 $aOHX$beng$cOHX$dYDXCP$dGWDNB$dBWX$dTXH$dOCLCQ$dDLC
042 $alccopycat
072 7 $aQA$2lcco
050 00 $aQA9.59$b.C67 2010
082 04 $a004.0151$222/ger
111 2 $aConference on Computability in Europe$n(6th :$d2010 :$cPonta Delgada, Azores, Portugal)
245 10 $aPrograms, proofs, processes :$b6th Conference on Computability in Europe, CiE, 2010, Ponta Delgada, Azores, Portugal, June 30-July 4, 2010 ; proceedings /$cFernando Ferreira ... [et al.] (eds.).
246 30 $aCiE 2010
260 $aBerlin ;$aNew York :$bSpringer,$c2010.
300 $axvi, 450 p. :$bill. ;$c24 cm.
490 1 $aLecture notes in computer science,$x0302-9743 ;$v6158
490 1 $aLNCS sublibrary. SL 1, Theoretical computer science and general issues
500 $aInternational conference proceedings.
504 $aIncludes bibliographical references and index.
650 0 $aComputable functions$vCongresses.
650 0 $aComputer science$xMathematics$vCongresses.
650 0 $aComputational complexity$vCongresses.
650 07 $aTheoretische Informatik.$2swd
650 07 $aBerechenbarkeit.$2swd
650 07 $aBerechnungskomplexität.$2swd
650 07 $aBeweistheorie.$2swd
650 07 $aProzessalgebra.$2swd
650 07 $aMathematische Logik.$2swd
700 1 $aFerreira, Fernando,$d1958-
830 0 $aLecture notes in computer science ;$v6158.$x0302-9743
830 0 $aLNCS sublibrary.$nSL 1,$pTheoretical computer science and general issues.