Sciweavers

    3208 search results - page 72 / 642
    » A Lower Bound for Primality
    Sort
    View
    FOCS
    2007
    IEEE
    97views Theoretical Computer Science» more  FOCS 2007»
    One-Way Multi-Party Communication Lower Bound for Pointer Jumping with Applications
    14 years 4 months ago
    One-Way Multi-Party Communication Lower Bound for Pointer Jumping with Applications
    Download  www.ccs.neu.edu
    Emanuele Viola, Avi Wigderson
    claim paper
    Read More »
    FOCS
    2007
    IEEE
    97views Theoretical Computer Science» more  FOCS 2007»
    Strong Lower Bounds for Approximating Distribution Support Size and the Distinct Elements Problem
    14 years 4 months ago
    Strong Lower Bounds for Approximating Distribution Support Size and the Distinct Elements Problem
    Download  www.cs.technion.ac.il
    Sofya Raskhodnikova, Dana Ron, Amir Shpilka, Adam ...
    claim paper
    Read More »
    ICC
    2007
    IEEE
    105views Communications» more  ICC 2007»
    Lower Bounds on the Capacity Regions of the Relay Channel and the Cooperative Relay-Broadcast Channel with Non-Causal Side Infor
    14 years 4 months ago
    Lower Bounds on the Capacity Regions of the Relay Channel and the Cooperative Relay-Broadcast Channel with Non-Causal Side Infor
    Download  www.prism.uvsq.fr
    — In this work, coding for the relay channel (RC) and the cooperative relay broadcast channel (RBC) controlled by random parameters are studied. In the first channel, the RC, in...
    Abdellatif Zaidi, Luc Vandendorpe, Pierre Duhamel
    claim paper
    Read More »
    APPROX
    2007
    Springer
    76views Algorithms» more  APPROX 2007»
    Lower bounds for testing forbidden induced substructures in bipartite-graph-like combinatorial objects
    14 years 4 months ago
    Lower bounds for testing forbidden induced substructures in bipartite-graph-like combinatorial objects
    Download  www.earendil.ath.cx
    Eldar Fischer, Eyal Rozenberg
    claim paper
    Read More »
    COCO
    2007
    Springer
    107views Algorithms» more  COCO 2007»
    A Linear Round Lower Bound for Lovasz-Schrijver SDP Relaxations of Vertex Cover
    14 years 4 months ago
    A Linear Round Lower Bound for Lovasz-Schrijver SDP Relaxations of Vertex Cover
    Download  www.math.ias.edu
    We study semidefinite programming relaxations of Vertex Cover arising from repeated applications of the LS+ “lift-and-project” method of Lovasz and Schrijver starting from th...
    Grant Schoenebeck, Luca Trevisan, Madhur Tulsiani
    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.