Sciweavers

    STOC
    1987
    ACM
    64views Algorithms» more  STOC 1987»
    On Learning Boolean Functions
    13 years 8 months ago
    On Learning Boolean Functions
    Download  www.ri.cmu.edu
    B. K. Natarajan
    claim paper
    Read More »
    STOC
    1987
    ACM
    56views Algorithms» more  STOC 1987»
    Matching Is as Easy as Matrix Inversion
    13 years 8 months ago
    Matching Is as Easy as Matrix Inversion
    Download  www.cc.gatech.edu
    Ketan Mulmuley, Umesh V. Vazirani, Vijay V. Vazira...
    claim paper
    Read More »
    STOC
    1987
    ACM
    45views Algorithms» more  STOC 1987»
    A New Graph Triconnectivity Algorithm and Its Parallelization
    13 years 8 months ago
    A New Graph Triconnectivity Algorithm and Its Parallelization
    Download  www.cs.cmu.edu
    Gary L. Miller, Vijaya Ramachandran
    claim paper
    Read More »
    STOC
    1987
    ACM
    52views Algorithms» more  STOC 1987»
    On the Learnability of Boolean Formulae
    13 years 8 months ago
    On the Learnability of Boolean Formulae
    Download  www.cis.upenn.edu
    Michael J. Kearns, Ming Li, Leonard Pitt, Leslie G...
    claim paper
    Read More »
    STOC
    1987
    ACM
    110views Algorithms» more  STOC 1987»
    How to Play any Mental Game or A Completeness Theorem for Protocols with Honest Majority
    13 years 8 months ago
    How to Play any Mental Game or A Completeness Theorem for Protocols with Honest Majority
    Download  www.jos.org.cn
    Oded Goldreich, Silvio Micali, Avi Wigderson
    claim paper
    Read More »
    STOC
    1987
    ACM
    104views Algorithms» more  STOC 1987»
    The Boolean Formula Value Problem Is in ALOGTIME
    13 years 8 months ago
    The Boolean Formula Value Problem Is in ALOGTIME
    Download  euclid.ucsd.edu
    The Boolean formula value problem is in alternating log time and, more generally, parenthesis context-free languages are in alternating log time. The evaluation of reverse Polish ...
    Samuel R. Buss
    claim paper
    Read More »
    STOC
    1987
    ACM
    46views Algorithms» more  STOC 1987»
    Size-Time Complexity of Boolean Networks for Prefix Computations
    13 years 8 months ago
    Size-Time Complexity of Boolean Networks for Prefix Computations
    Download  www.cs.brown.edu
    Gianfranco Bilardi, Franco P. Preparata
    claim paper
    Read More »
    STOC
    1987
    ACM
    82views Algorithms» more  STOC 1987»
    Permutation Groups in NC
    13 years 8 months ago
    Permutation Groups in NC
    Download  ix.cs.uoregon.edu
    We show that the basic problems of permutation group manipulation admit e cient parallel solutions. Given a permutation group G by a list of generators, we nd a set of NC-e cient ...
    László Babai, Eugene M. Luks, &Aacut...
    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.