LEADER 01489nam 2200361Ia 450 001 996383761903316 005 20221108105447.0 035 $a(CKB)1000000000600096 035 $a(EEBO)2240949173 035 $a(UnM)99895567 035 $a(UnM)9928638300971 035 $a(EXLCZ)991000000000600096 100 $a19931222d1669 uy | 101 0 $aeng 135 $aurbn||||a|bb| 200 14$aThe imperial tragedy: written by a gentleman for his own diversion: and now made publick at the importunity of friends. Imprimatur, January 12. 1668. Roger L'Estrange$b[electronic resource] 210 $aLondon $cprinted for Will. Wells and Rob. Scott at the Prince's-Armes in Little Britain$dM.DC.LXIX. [1669] 215 $a[4], 51, [1] p 300 $aBy Sir William Killigrew. 300 $aIn verse. 300 $aMost running titles read: The emperial tragedy. 300 $aA reissue, with cancel title page, of "The imperial tragedy: taken out of a Latin play". 300 $aReproduction of original in the Henry E. Huntington Library. 330 $aeebo-0113 700 $aKilligrew$b William$cSir,$f1606-1695.$01001618 801 0$bCu-RivES 801 1$bCu-RivES 801 2$bCStRLIN 801 2$bWaOLN 906 $aBOOK 912 $a996383761903316 996 $aThe imperial tragedy: written by a gentleman for his own diversion: and now made publick at the importunity of friends. Imprimatur, January 12. 1668. Roger L'Estrange$92413261 997 $aUNISA LEADER 01025nam a2200277 i 4500 001 991004161889707536 005 20020509155125.0 008 950602s1986 ||| ||| | ger 020 $a3487076608 035 $ab11277154-39ule_inst 035 $aPARLA196873$9ExL 040 $aDip.to Filol. Class. e Med.$bita 082 0 $a871.01 100 1 $aClassen, Carl Joachim$0181210 245 10$aProbleme der Lukrezforschung /$cherausgegeben von Carl Joachim Classen 260 $aHildesheim - New York :$bOlms,$c1986 300 $axv, 438 p. ;$c23 cm. 490 0 $aOlms studien ;$v18 500 $aIncludes bibliographical references and index. 650 4$aLucrezio Caro, Tito$xStudi 907 $a.b11277154$b23-02-17$c01-07-02 912 $a991004161889707536 945 $aLE007 870.1 Lucretius CLA 01.501$g1$i2007000022221$lle007$o-$pE0.00$q-$rl$s- $t0$u0$v0$w0$x0$y.i11441380$z01-07-02 996 $aProbleme der Lukrezforschung$9865198 997 $aUNISALENTO 998 $ale007$b01-01-95$cm$da $e-$feng$gxx $h0$i1 LEADER 04152oam 2200421zu 450 001 9910872712803321 005 20241212215050.0 035 $a(CKB)111055184227354 035 $a(SSID)ssj0000455445 035 $a(PQKBManifestationID)12148338 035 $a(PQKBTitleCode)TC0000455445 035 $a(PQKBWorkID)10399643 035 $a(PQKB)11548361 035 $a(NjHacI)99111055184227354 035 $a(EXLCZ)99111055184227354 100 $a20160829d2002 uy 101 0 $aeng 135 $aur||||||||||| 181 $ctxt 182 $cc 183 $acr 200 10$a17th IEEE Annual Conference on Computational Complexity (CCC 2002) 210 31$a[Place of publication not identified]$cIEEE Computer Society Press$d2002 215 $a1 online resource (xii, 205 pages) $cillustrations 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$a9780769514680 311 08$a0769514685 327 $aPreface -- Committees -- Ron Book Prize for Best Student Paper -- 2002 Best Paper Award -- Resolution Lower Bounds for the Weak Pigeonhole Principle -- Hard examples for bounded depth frege -- Resolution lower bounds for the weak pigeon hole principle -- Hard examples for bounded depth Frege -- Improved cryptographic hash functions with worst-case/average-case connection -- Algorithmic derandomization via complexity theory -- Pseudo-random generators for all hardnesses -- Randomness conductors and constant-degree lossless expanders -- Expanders from symmetric codes -- The complexity of approximating the entropy -- Time-space tradeoffs, multiparty communication complexity, and nearest-neighbor problems -- On communication over an entanglement-assisted quantum channel -- Hardness amplification within NP -- 3-MANIFOLD KNOT GENUS is NP-complete -- On the power of unique 2-prover 1-round games -- Learnability beyond AC/sup 0/ -- Resolution lower bounds for perfect matching principles -- Resolution width-size trade-offs for the Pigeon-Hole Principle -- The inapproximability of lattice and coding problems with preprocessing -- Sampling short lattice vectors and the closest lattice vector problem -- The history of complexity -- The correlation between parity and quadratic polynomials mod 3 -- Functions that have read-twice constant width branching programs are not necessarily testable -- On the complexity of integer multiplication in branching programs with multiple tests and in read-once branching programs with limited nondeterminism -- Information theory methods in communication complexity -- Extracting quantum entanglement (general entanglement purification protocols) -- Algebras of minimal rank over perfect fields -- Rapid mixing -- Pseudorandomness and average-case complexity via uniform reductions -- Pseudo-random generators and structure of complete degrees -- Decoding concatenated codes using soft information -- Arthur and Merlin in a quantum world -- Streaming computation of combinatorial objects -- Lower bounds for linear locally decodable codes and private information retrieval -- Better lower bounds for locally decodable codes -- Universal arguments and their applications -- Author index. 330 $aThirty-six papers originally presented at the May 2002 conference sponsored by the IEEE Computer Society cover a range of issues in computational complexity. They look at such topics as hard examples for bounded depth frege, relations between average case complexity and approximation complexity, algorithmic derandomization via complexity theory, randomness conductors and constant-degree lossless expanders, resolution lower bounds for perfect matching principles, information theory methods in communication complexity, and pseudo-random generators and structure of complete degrees. Annotation copyrighted by Book News, Inc., Portland, OR. 606 $aComputational complexity$vCongresses 615 0$aComputational complexity 676 $a511.3 702 $aIEEE Staff 801 0$bPQKB 906 $aPROCEEDING 912 $a9910872712803321 996 $a17th IEEE Annual Conference on Computational Complexity (CCC 2002)$92359233 997 $aUNINA