Sciweavers

    87 search results - page 18 / 18
    » focs 2008
    Sort
    View
    SODA
    2008
    ACM
    100views Algorithms» more  SODA 2008»
    A tight lower bound for parity in noisy communication networks
    13 years 6 months ago
    A tight lower bound for parity in noisy communication networks
    Download  www.tcs.tifr.res.in
    We show a tight lower bound of (N log log N) on the number of transmission required to compute the parity of N bits (with constant error) in a network of N randomly placed sensors...
    Chinmoy Dutta, Yashodhan Kanoria, D. Manjunath, Ja...
    claim paper
    Read More »
    ECCC
    2011
    223views ECommerce» more  ECCC 2011»
    A Case of Depth-3 Identity Testing, Sparse Factorization and Duality
    12 years 11 months ago
    A Case of Depth-3 Identity Testing, Sparse Factorization and Duality
    Download  www.mpi-inf.mpg.de
    Polynomial identity testing (PIT) problem is known to be challenging even for constant depth arithmetic circuits. In this work, we study the complexity of two special but natural ...
    Chandan Saha, Ramprasad Saptharishi, Nitin Saxena
    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.