Sciweavers

    19320 search results - page 138 / 3864
    » On the complexity of computing determinants
    Sort
    View
    IJSYSC
    2011
    60views more  IJSYSC 2011»
    On necessary conditions for scale-freedom in complex networks, with applications to computer communication systems
    14 years 12 months ago
    On necessary conditions for scale-freedom in complex networks, with applications to computer communication systems
    Download  www.ece.ucsb.edu
    Wenjun Xiao, Weidong Chen, Behrooz Parhami
    claim paper
    Read More »
    SYNTHESE
    2011
    87views more  SYNTHESE 2011»
    Information theory, evolutionary computation, and Dembski's "complex specified information"
    14 years 12 months ago
    Information theory, evolutionary computation, and Dembski's "complex specified information"
    Download  www.talkreason.org
    Wesley R. Elsberry, Jeffrey Shallit
    claim paper
    Read More »
    CACM
    2011
    97views more  CACM 2011»
    Computational complexity and information asymmetry in financial products
    14 years 8 months ago
    Computational complexity and information asymmetry in financial products
    Download  www.cs.princeton.edu
    Sanjeev Arora, Boaz Barak, Markus Brunnermeier, Ro...
    claim paper
    Read More »
    155
    Voted
    CCDS
    2010
    122views more  CCDS 2010»
    The problem of mutually unbiased bases in dimension 6
    15 years 2 months ago
    The problem of mutually unbiased bases in dimension 6
    Download  www.math.bme.hu
    We outline a discretization approach to determine the maximal number of mutually unbiased bases in dimension 6. We describe the basic ideas and introduce the most important definit...
    Philippe Jaming, Máté Matolcsi, P&ea...
    claim paper
    Read More »
    113
    Voted
    ICALP
    2005
    Springer
    93views Programming Languages» more  ICALP 2005»
    Optimal In-place Sorting of Vectors and Records
    15 years 10 months ago
    Optimal In-place Sorting of Vectors and Records
    Download  www.di.unipi.it
    Abstract. We study the problem of determining the complexity of optimal comparison-based in-place sorting when the key length, k, is not a constant. We present the first algorithm...
    Gianni Franceschini, Roberto Grossi
    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.