arXiv 2003-02-18 EN Cryptographic Randomized Response Techniques Ambainis, Andris · Jakobsson, Markus · Lipmaa, Helger
arXiv 2003-02-03 EN Approximate analysis of search algorithms with "physical" methods Cocco, Simona · Monasson, Remi · Montanari, Andrea · Semerjian, Guilhem
arXiv 2003-02-01 EN Many Hard Examples in Exact Phase Transitions with Application to Generating Hard Satisfiable Instances Xu, Ke · Li, Wei
arXiv 2003-01-16 EN Lower Bounds on the Bounded Coefficient Complexity of Bilinear Maps Buergisser, Peter · Lotz, Martin
arXiv 2003-01-16 EN Some remarks on the survey decimation algorithm for K-satisfiability Parisi, Giorgio
arXiv 2002-12-10 EN Real numbers having ultimately periodic representations in abstract numeration systems Lecomte, P. · Rigo, M.
arXiv 2002-12-07 EN On the survey-propagation equations for the random K-satisfiability problem Parisi, Giorgio
arXiv 2002-12-03 EN Traveling Salesmen in the Presence of Competition Fekete, Sandor P. · Fleischer, Rudolf · Fraenkel, Aviezri · Schmitt, Matthias
arXiv 2002-12-01 EN Mathematical foundations of modern cryptography: computational complexity perspective Goldwasser, Shafi
arXiv 2002-11-26 EN Typical random 3-SAT formulae and the satisfiability threshold Dubois, Olivier · Boufkhad, Yacine · Mandler, Jacques
arXiv 2002-11-25 EN Solution Bounds for a Hypothetical Polynomial Time Aproximation Algorithm for the TSP Yaneff, A. G.
arXiv 2002-11-21 EN Effective Strong Dimension, Algorithmic Information, and Computational Complexity Athreya, Krishna B. · Hitchcock, John M. · Lutz, Jack H. · Mayordomo, Elvira
