Sciweavers

    CSR
    2009
    Springer
    121views Theoretical Computer Science» more  CSR 2009»
    On Random Ordering Constraints
    14 years 6 months ago
    On Random Ordering Constraints
    Download  www.tu-chemnitz.de
    Abstract. Ordering constraints are analogous to instances of the satisfiability problem in conjunctive normalform, but instead of a boolean assignment we consider a linear orderin...
    Andreas Goerdt
    claim paper
    Read More »
    CSR
    2009
    Springer
    140views Theoretical Computer Science» more  CSR 2009»
    On the Complexity of Matroid Isomorphism Problems
    14 years 6 months ago
    On the Complexity of Matroid Isomorphism Problems
    Download  itcs.tsinghua.edu.cn
    We study the complexity of testing if two given matroids are isomorphic. The problem is easily seen to be in Σp 2 . In the case of linear matroids, which are represented over poly...
    B. V. Raghavendra Rao, Jayalal M. N. Sarma
    claim paper
    Read More »
    CSR
    2009
    Springer
    98views Theoretical Computer Science» more  CSR 2009»
    Formal Verification of Gate-Level Computer Systems
    14 years 6 months ago
    Formal Verification of Gate-Level Computer Systems
    Download  www-wjp.cs.uni-saarland.de
    Mark A. Hillebrand, Sergey Tverdyshev
    claim paper
    Read More »
    CSR
    2009
    Springer
    112views Theoretical Computer Science» more  CSR 2009»
    Simulation of Arithmetical Circuits by Branching Programs with Preservation of Constant Width and Syntactic Multilinearity
    14 years 6 months ago
    Simulation of Arithmetical Circuits by Branching Programs with Preservation of Constant Width and Syntactic Multilinearity
    Download  itcs.tsinghua.edu.cn
    Abstract. We study structural properties of restricted width arithmetical circuits. It is shown that syntactically multilinear arithmetical circuits of constant width can be effici...
    Maurice J. Jansen, B. V. Raghavendra Rao
    claim paper
    Read More »
    CSR
    2009
    Springer
    149views Theoretical Computer Science» more  CSR 2009»
    Partitioning Graphs into Connected Parts
    14 years 6 months ago
    Partitioning Graphs into Connected Parts
    Download  www.dur.ac.uk
    The 2-Disjoint Connected Subgraphs problem asks if a given graph has two vertex-disjoint connected subgraphs containing prespecified sets of vertices. We show that this problem is...
    Pim van 't Hof, Daniël Paulusma, Gerhard J. W...
    claim paper
    Read More »
    CSR
    2009
    Springer
    90views Theoretical Computer Science» more  CSR 2009»
    Canonical Calculi: Invertibility, Axiom Expansion and (Non)-determinism
    14 years 6 months ago
    Canonical Calculi: Invertibility, Axiom Expansion and (Non)-determinism
    Download  www.logic.at
    We apply the semantic tool of non-deterministic matrices to characterize two important properties of canonical Gentzen-type calculi: invertibility of rules and axiom expansion. We ...
    Arnon Avron, Agata Ciabattoni, Anna Zamansky
    claim paper
    Read More »
    CSR
    2009
    Springer
    112views Theoretical Computer Science» more  CSR 2009»
    Approximability Distance in the Space of H-Colourability Problems
    14 years 6 months ago
    Approximability Distance in the Space of H-Colourability Problems
    Download  www.ida.liu.se
    Tommy Färnqvist, Peter Jonsson, Johan Thapper
    claim paper
    Read More »
    CSR
    2009
    Springer
    96views Theoretical Computer Science» more  CSR 2009»
    Lower Bounds for the Determinantal Complexity of Explicit Low Degree Polynomials
    14 years 6 months ago
    Lower Bounds for the Determinantal Complexity of Explicit Low Degree Polynomials
    Download  itcs.tsinghua.edu.cn
    Maurice J. Jansen
    claim paper
    Read More »
    CSR
    2009
    Springer
    161views Theoretical Computer Science» more  CSR 2009»
    The Budgeted Unique Coverage Problem and Color-Coding
    14 years 6 months ago
    The Budgeted Unique Coverage Problem and Color-Coding
    Download  www.imsc.res.in
    Neeldhara Misra, Venkatesh Raman, Saket Saurabh, S...
    claim paper
    Read More »
    CSR
    2009
    Springer
    108views Theoretical Computer Science» more  CSR 2009»
    Compressed Word Problems in HNN-Extensions and Amalgamated Products
    14 years 6 months ago
    Compressed Word Problems in HNN-Extensions and Amalgamated Products
    Download  www.informatik.uni-leipzig.de
    Niko Haubold, Markus Lohrey
    claim paper
    Read More »
    « first‹ previous12
    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.