Sciweavers

    1522 search results - page 17 / 305
    » On the Complexity of Several Haplotyping Problems
    Sort
    View
    FOCS
    2007
    IEEE
    174views Theoretical Computer Science» more  FOCS 2007»
    On the Complexity of Nash Equilibria and Other Fixed Points (Extended Abstract)
    14 years 2 months ago
    On the Complexity of Nash Equilibria and Other Fixed Points (Extended Abstract)
    Download  homepages.inf.ed.ac.uk
    d Abstract) Kousha Etessami LFCS, School of Informatics University of Edinburgh Mihalis Yannakakis Department of Computer Science Columbia University We reexamine what it means to...
    Kousha Etessami, Mihalis Yannakakis
    claim paper
    Read More »
    JAIR
    2008
    145views more  JAIR 2008»
    Efficiency and Envy-freeness in Fair Division of Indivisible Goods: Logical Representation and Complexity
    13 years 7 months ago
    Efficiency and Envy-freeness in Fair Division of Indivisible Goods: Logical Representation and Complexity
    Download  jair.org
    We consider the problem of allocating fairly a set of indivisible goods among agents from the point of view of compact representation and computational complexity. We start by ass...
    Sylvain Bouveret, Jérôme Lang
    claim paper
    Read More »
    KR
    2010
    Springer
    230views Automated Reasoning» more  KR 2010»
    On the Complexity of Axiom Pinpointing in the EL Family of Description Logics
    13 years 11 months ago
    On the Complexity of Axiom Pinpointing in the EL Family of Description Logics
    Download  lat.inf.tu-dresden.de
    We investigate the computational complexity of axiom pinpointing, which is the task of finding minimal subsets of a Description Logic knowledge base that have a given consequence...
    Rafael Peñaloza, Baris Sertkaya
    claim paper
    Read More »
    DAM
    1999
    119views more  DAM 1999»
    On the Algorithmic Complexity of Twelve Covering and Independence Parameters of Graphs
    13 years 7 months ago
    On the Algorithmic Complexity of Twelve Covering and Independence Parameters of Graphs
    Download  www.dcs.gla.ac.uk
    The definitions of four previously studied parameters related to total coverings and total matchings of graphs can be restricted, thereby obtaining eight parameters related to cov...
    David Manlove
    claim paper
    Read More »
    MOC
    2002
    131views more  MOC 2002»
    Some baby-step giant-step algorithms for the low hamming weight discrete logarithm problem
    13 years 7 months ago
    Some baby-step giant-step algorithms for the low hamming weight discrete logarithm problem
    Download  www.ams.org
    In this paper, we present several baby-step giant-step algorithms for the low hamming weight discrete logarithm problem. In this version of the discrete log problem, we are require...
    Douglas R. Stinson
    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.