LEADER 01629nam0 2200325 i 450 
001 VAN0054248
005 20231219050617.198
010   $a978-08-218-0577-0
100   $a20061006d1998       |0itac50      ba
101   $aeng
102   $aUS
105   $a||||    |||||
200 1 $aProof complexity and feasible arithmetics$fedited by Paul W. Beame, Samuel R. Buss
210   $aProvidence$cAmerican mathematical society$d1998
215   $aXII, 320 p.$d24 cm
410  1$1001VAN0038792$12001 $aDIMACS series in discrete mathematics and theoretical computer science$1210  $aProvidence$cAmerican mathematical society$v39
606   $a68R05$xCombinatorics in computer science [MSC 2020]$3VANC023622$2MF
606   $a03Fxx$xProof theory and constructive mathematics [MSC 2020]$3VANC024383$2MF
606   $a68Q15$xComplexity classes (hierarchies, relations among complexity classes, etc.) [MSC 2020]$3VANC028792$2MF
620   $aUS$dProvidence$3VANL000273
702  1$aBeame$bPaul W.$3VANV042871
702  1$aBuss$bSamuel R.$3VANV042870
712   $aAmerican mathematical society$3VANV108732$4650
801   $aIT$bSOL$c20231222$gRICA
856 4 $u/sebina/repository/catalogazione/documenti/Beame, Buss - Proof complexity and feasible arithmetics.PDF$zContents
899   $aBIBLIOTECA DEL DIPARTIMENTO DI MATEMATICA E FISICA$1IT-CE0120$2VAN08
912   $aVAN0054248
950   $aBIBLIOTECA DEL DIPARTIMENTO DI MATEMATICA E FISICA$d08PREST     03-XX                   0288        $e08   6350      I       20061006            
996   $aProof complexity and feasible arithmetics$91425177
997   $aUNICAMPANIA