Sciweavers

    MST
    2007
    104views more  MST 2007»
    Randomized Algorithms for 3-SAT
    14 years 5 months ago
    Randomized Algorithms for 3-SAT
    Download  www.uni-ulm.de
    In [Sch99], Sch¨oning proposed a simple yet efficient randomized algorithm for solving the k-SAT problem. In the case of 3-SAT, the algorithm has an expected running time of poly...
    Thomas Hofmeister, Uwe Schöning, Rainer Schul...
    claim paper
    Read More »
    MOC
    2002
    121views more  MOC 2002»
    Computing discrete logarithms in high-genus hyperelliptic Jacobians in provably subexponential time
    14 years 5 months ago
    Computing discrete logarithms in high-genus hyperelliptic Jacobians in provably subexponential time
    Download  www.ams.org
    We provide a subexponential algorithm for solving the discrete logarithm problem in Jacobians of high-genus hyperelliptic curves over finite fields. Its expected running time for i...
    Andreas Enge
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2025, USA.