Sciweavers

    16 search results - page 3 / 4
    » fct 2003
    Sort
    View
    FCT
    2003
    Springer
    127views Applied Computing» more  FCT 2003»
    On Exact and Approximation Algorithms for Distinguishing Substring Selection
    15 years 2 months ago
    On Exact and Approximation Algorithms for Distinguishing Substring Selection
    Download  theinf1.informatik.uni-jena.de
    Abstract. The NP-complete Distinguishing Substring Selection problem (DSSS for short) asks, given a set of “good” strings and a set of “bad” strings, for a solution string ...
    Jens Gramm, Jiong Guo, Rolf Niedermeier
    claim paper
    Read More »
    68
    Voted
    FCT
    2003
    Springer
    93views Applied Computing» more  FCT 2003»
    An Extended Quadratic Frobenius Primality Test with Average and Worst Case Error Estimates
    15 years 2 months ago
    An Extended Quadratic Frobenius Primality Test with Average and Worst Case Error Estimates
    Download  www.daimi.au.dk
    We present an Extended Quadratic Frobenius Primality Test (EQFT), which is related to the Miller-Rabin test and to several other known probabilistic tests. EQFT takes time equival...
    Ivan Damgård, Gudmund Skovbjerg Frandsen
    claim paper
    Read More »
    FCT
    2003
    Springer
    90views Applied Computing» more  FCT 2003»
    On a Logical Approach to Estimating Computational Complexity of Potentially Intractable Problems
    15 years 2 months ago
    On a Logical Approach to Estimating Computational Complexity of Potentially Intractable Problems
    Download  www.ida.liu.se
    Abstract. In the paper we present a purely logical approach to estimating computational complexity of potentially intractable problems. The approach is based on descriptive complex...
    Andrzej Szalas
    claim paper
    Read More »
    FCT
    2003
    Springer
    163views Applied Computing» more  FCT 2003»
    On Boundaries of Highly Visible Spaces and Applications
    15 years 2 months ago
    On Boundaries of Highly Visible Spaces and Applications
    Download  www.cs.duke.edu
    The purpose of this paper is to investigate the properties of a certain class of highly visible spaces. For a given geometric space C containing obstacles specified by disjoint s...
    John H. Reif, Zheng Sun
    claim paper
    Read More »
    FCT
    2003
    Springer
    188views Applied Computing» more  FCT 2003»
    Graph Searching, Elimination Trees, and a Generalization of Bandwidth
    15 years 2 months ago
    Graph Searching, Elimination Trees, and a Generalization of Bandwidth
    Download  www.ii.uib.no
    The bandwidth minimization problem has a long history and a number of practical applications. In this paper we introduce a natural extension of bandwidth to partially ordered layo...
    Fedor V. Fomin, Pinar Heggernes, Jan Arne Telle
    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-2025, USA.