02368cam a2200385 a 4500005030864MiAaHDL20250726000000.0m d cr bn ---auaua050502t20042003it b 000 0 eng d8879994131(MiU)990050308640106381sdr-miu.990050308640106381(MiU)MIU01000000000000005030864-goog(OCoLC)60035969(MiU)Aleph005030864TXHTXHUtOrBLWEYMGQA267.7.C665 2003QA 267.7 .C6645 2004Complexity of computations and proofs /edited by Jan Krajíček.Roma (Italy) :Aracne,2004, c2003.424 p. :ill. ;22 cm.texttxtrdacontentunmediatednrdamediavolumencrdacarrierQuaderni di matematica ;v. 13Includes bibliographical references.Generating hard instances of lattice problems / Miklós Ajtai -- Arithmetic circuits and counting complexity cases / Eric Allender -- Variations by complexity theorists on three themes of Euler, Bézout, Betti, and Poincaré / Peter Bürgisser and Felipe Cucker -- Bounded arithmetic and constant depth Frege proofs / Samuel R. Buss -- Theories for complexity classes and their propositional translations / Stephen Cook -- Kolmogorov complexity and computational complexity / Lance Fortnow -- Zero-knowledge twenty years after its invention / Oded Goldreich -- Homomorphic public-key cryptosystems over groups and rings / Dima Grigoriev and Ilia Ponomarenko -- Pseudorandom sets and explicit constructions of Ramsey graphs / Pave Pudlák and Vojtěch Rödl -- Some applications of coding theory in computational complexity / Luca Trevisa.Mode of access: Internet.Cryptography.http://id.loc.gov/authorities/subjects/sh85034453Kolmogorov complexity.http://id.loc.gov/authorities/subjects/sh92003782Coding theory.http://id.loc.gov/authorities/subjects/sh85027654Proof theory.http://id.loc.gov/authorities/subjects/sh85107437Computational complexity.http://id.loc.gov/authorities/subjects/sh85029473Krajíček, Jan.3901506057462400503086420241217233224.020250726000000.020260319140655.02026-03-20T05:34:26Z2025-10-06T17:50:04ZSDR-MIUmiuALMAprepare.pl-004-009BKsdr-miu.990050308640106381MiUSDRMIU005030864mdp.39015060574624MIU990050308640106381MIUMIU20260320googlemdp.390150605746242003icbibnon-US bib date2, date type t >= 1931