Sciweavers

    STOC
    1989
    ACM
    96views Algorithms» more  STOC 1989»
    Optimal Size Integer Division Circuits
    13 years 8 months ago
    Optimal Size Integer Division Circuits
    Download  www.cs.duke.edu
    Division is a fundamental problem for arithmetic and algebraic computation. This paper describes Boolean circuits of bounded fan-in for integer division  nding reciprocals that...
    John H. Reif, Stephen R. Tate
    claim paper
    Read More »
    STOC
    1989
    ACM
    66views Algorithms» more  STOC 1989»
    The Minimum Consistent DFA Problem Cannot Be Approximated within any Polynomial
    13 years 8 months ago
    The Minimum Consistent DFA Problem Cannot Be Approximated within any Polynomial
    Download  users.soe.ucsc.edu
    Leonard Pitt, Manfred K. Warmuth
    claim paper
    Read More »
    STOC
    1989
    ACM
    95views Algorithms» more  STOC 1989»
    A Hard-Core Predicate for all One-Way Functions
    13 years 8 months ago
    A Hard-Core Predicate for all One-Way Functions
    Download  www.wisdom.weizmann.ac.il
    Oded Goldreich, Leonid A. Levin
    claim paper
    Read More »
    STOC
    1989
    ACM
    99views Algorithms» more  STOC 1989»
    A Random Polynomial Time Algorithm for Approximating the Volume of Convex Bodies
    13 years 8 months ago
    A Random Polynomial Time Algorithm for Approximating the Volume of Convex Bodies
    Download  www.math.cmu.edu
    We present a randomised polynomial time algorithm for approximating the volume of a convex body K in n-dimensional Euclidean space. The proof of correctness of the algorithm relie...
    Martin E. Dyer, Alan M. Frieze, Ravi Kannan
    claim paper
    Read More »
    STOC
    1989
    ACM
    72views Algorithms» more  STOC 1989»
    Trading Space for Time in Undirected s-t Connectivity
    13 years 8 months ago
    Trading Space for Time in Undirected s-t Connectivity
    Download  www.hpl.hp.com
    Andrei Z. Broder, Anna R. Karlin, Prabhakar Raghav...
    claim paper
    Read More »
    STOC
    1989
    ACM
    117views Algorithms» more  STOC 1989»
    On the Theory of Average Case Complexity
    13 years 8 months ago
    On the Theory of Average Case Complexity
    Download  www.cs.technion.ac.il
    This paper takes the next step in developing the theory of average case complexity initiated by Leonid A Levin. Previous works Levin 84, Gurevich 87, Venkatesan and Levin 88] have...
    Shai Ben-David, Benny Chor, Oded Goldreich, Michae...
    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-2024, USA.