Sciweavers

    983 search results - page 26 / 197
    » Circuit Complexity and Multiplicative Complexity of Boolean ...
    Sort
    View
    DM
    2006
    73views more  DM 2006»
    Composition of Post classes and normal forms of Boolean functions
    13 years 7 months ago
    Composition of Post classes and normal forms of Boolean functions
    Download  math.tut.fi
    The class composition C K of Boolean clones, being the set of composite functions f(g1, . . . , gn) with f C, g1, . . . , gn K, is investigated. This composition C K is either...
    Miguel Couceiro, Stephan Foldes, Erkko Lehtonen
    claim paper
    Read More »
    BMCBI
    2010
    177views more  BMCBI 2010»
    Clustering of protein families into functional subtypes using Relative Complexity Measure with reduced amino acid alphabets
    13 years 7 months ago
    Clustering of protein families into functional subtypes using Relative Complexity Measure with reduced amino acid alphabets
    Download  www.biomedcentral.com
    Background: Phylogenetic analysis can be used to divide a protein family into subfamilies in the absence of experimental information. Most phylogenetic analysis methods utilize mu...
    Aydin Albayrak, Hasan H. Otu, Ugur O. Sezerman
    claim paper
    Read More »
    DAC
    2005
    ACM
    169views Computer Architecture» more  DAC 2005»
    A new canonical form for fast boolean matching in logic synthesis and verification
    14 years 8 months ago
    A new canonical form for fast boolean matching in logic synthesis and verification
    Download  atrak.usc.edu
    ? An efficient and compact canonical form is proposed for the Boolean matching problem under permutation and complementation of variables. In addition an efficient algorithm for co...
    Afshin Abdollahi, Massoud Pedram
    claim paper
    Read More »
    DAC
    2003
    ACM
    129views Computer Architecture» more  DAC 2003»
    A new enhanced constructive decomposition and mapping algorithm
    14 years 8 months ago
    A new enhanced constructive decomposition and mapping algorithm
    Download  www.eecs.berkeley.edu
    Structuring and mapping of a Boolean function is an important problem in the design of complex integrated circuits. Libraryaware constructive decomposition offers a solution to th...
    Alan Mishchenko, Xinning Wang, Timothy Kam
    claim paper
    Read More »
    ICTCS
    2003
    Springer
    119views Theoretical Computer Science» more  ICTCS 2003»
    On the Computational Complexity of Cut-Elimination in Linear Logic
    14 years 27 days ago
    On the Computational Complexity of Cut-Elimination in Linear Logic
    Download  www.cs.brandeis.edu
    Abstract. Given two proofs in a logical system with a confluent cutelimination procedure, the cut-elimination problem (CEP) is to decide whether these proofs reduce to the same no...
    Harry G. Mairson, Kazushige Terui
    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.