13603 search results - page 107 / 2721 » On the Complexity of Computing Treelength |
FOCS
1997
IEEE
14 years 1 months ago
1997
IEEE
Abstract. We show how to associate e ectively computableobstructions to a waitfree distributed decision task (I;O; ) in the asynchronous shared-memory, readwrite model. The key new...
EATCS
2002
13 years 9 months ago
2002
We explain the essence of K. Mulmuley and M. Sohoni, "Geometric Complexity Theory I: An Approach to the P vs. NP and Related Problems" [MS02] for a general complexity-the...
ECCC
2007
13 years 9 months ago
2007
We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are not fixed-parameter tractable. We consider proofs that witness that a given pro...
FECS
2010
13 years 7 months ago
2010
In this paper, we present a method to help teach computer architecture (or computer organization) by developing an in class system where the students, themselves, compile high-leve...
ACL
2009
13 years 7 months ago
2009
ProLiV - Animated Process-modeler of Complex (Computational) Linguistic Methods and Theories - is a fully modular, flexible, XML-based stand-alone Java application, used for compu...