Sciweavers

    82 search results - page 2 / 17
    » mst 2006
    Sort
    View
    MST
    2007
    93views more  MST 2007»
    The Complexity of the Descriptiveness of Boolean Circuits over Different Sets of Gates
    15 years 3 months ago
    The Complexity of the Descriptiveness of Boolean Circuits over Different Sets of Gates
    Download  www.thi.uni-hannover.de
    Elmar Böhler, Henning Schnoor
    claim paper
    Read More »
    MST
    2007
    89views more  MST 2007»
    A Faster FPT Algorithm for the Maximum Agreement Forest Problem
    15 years 3 months ago
    A Faster FPT Algorithm for the Maximum Agreement Forest Problem
    Download  www-ist.massey.ac.nz
    Michael T. Hallett, Catherine McCartin
    claim paper
    Read More »
    97
    Voted
    MST
    2010
    75views more  MST 2010»
    Generic Complexity of Presburger Arithmetic
    15 years 1 months ago
    Generic Complexity of Presburger Arithmetic
    Download  a-server.math.nsc.ru
    Alexander Rybalov
    claim paper
    Read More »
    95
    Voted
    MST
    2010
    92views more  MST 2010»
    Bijective Linear Time Coding and Decoding for k-Trees
    15 years 1 months ago
    Bijective Linear Time Coding and Decoding for k-Trees
    Download  www.dsi.uniroma1.it
    Saverio Caminiti, Emanuele G. Fusco, Rossella Petr...
    claim paper
    Read More »
    MST
    2006
    53views more  MST 2006»
    Why Computational Complexity Requires Stricter Martingales
    15 years 3 months ago
    Why Computational Complexity Requires Stricter Martingales
    Download  www.cs.uwyo.edu
    John M. Hitchcock, Jack H. Lutz
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    i2PDF i2Img i2Text i2OCR i2Symbol i2Type i2Speak i2Style i2Arabic i2Bopomo Latex Equation Editor
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2026, USA.