Sciweavers

    2 search results - page 1 / 1
    » An algorithm for finding a basis of the fixed point subgroup...
    Sort
    View
    IJAC
    2007
    116views more  IJAC 2007»
    On the Complexity of the Whitehead Minimization Problem
    13 years 4 months ago
    On the Complexity of the Whitehead Minimization Problem
    Download  www.crm.es
    The Whitehead minimization problem consists in finding a minimum size element in the automorphic orbit of a word, a cyclic word or a finitely generated subgroup in a finite rank...
    Abdó Roig, Enric Ventura, Pascal Weil
    claim paper
    Read More »
    STOC
    2009
    ACM
    187views Algorithms» more  STOC 2009»
    Artin automorphisms, cyclotomic function fields, and folded list-decodable codes
    14 years 5 months ago
    Artin automorphisms, cyclotomic function fields, and folded list-decodable codes
    Download  eccc.hpi-web.de
    Algebraic codes that achieve list decoding capacity were recently constructed by a careful "folding" of the Reed-Solomon code. The "low-degree" nature of this f...
    Venkatesan Guruswami
    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.