| Record ID | marc_records_scriblio_net/part23.dat:149908118:1105 |
| Source | Scriblio |
| Download Link | /show-records/marc_records_scriblio_net/part23.dat:149908118:1105?format=raw |
LEADER: 01105cam 2200265 a 4500
001 93111192
003 DLC
005 20020828200535.0
008 930203s1992 enka b 100 0 eng
010 $a 93111192
020 $a0521408261
040 $aDLC$cDLC$dDLC
050 00 $aQA267.7$b.B66 1992
082 00 $a511.3/24$220
245 00 $aBoolean function complexity /$cedited by M.S. Paterson.
260 $aCambridge ;$aNew York, NY, USA :$bCambridge University Press,$c1992.
300 $a201 p. :$bill. ;$c23 cm.
440 0 $aLondon Mathematical Society lecture note series ;$v169
500 $aPapers from the Symposium on Boolean Function Complexity, held July, 1990, at Durham University and sponsored by the London Mathematical Society.
504 $aIncludes bibliographical references (p. 198-201).
650 0 $aComputational complexity$xCongresses.
650 0 $aAlgebra, Boolean.
700 1 $aPaterson, Michael S.
856 42 $3Publisher description$uhttp://www.loc.gov/catdir/description/cam026/93111192.html
856 41 $3Table of contents$uhttp://www.loc.gov/catdir/toc/cam027/93111192.html