13603 search results - page 35 / 2721 » On the Computational Complexity of Cut-Reduction |
TCS
2002
13 years 8 months ago
2002
We discuss several complexity measures for Boolean functions: certi cate complexity, sensitivity, block sensitivity, and the degree of a representing or approximating polynomial. ...
JSC
2007
13 years 8 months ago
2007
We generalize the concept of a cycle from graphs to simplicial complexes. We show that a simplicial cycle is either a sequence of facets connected in the shape of a circle, or is ...
FOCS
1997
IEEE
14 years 21 days 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...
ECCC
2007
13 years 8 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...
COMPGEOM
1989
ACM
14 years 16 days ago
1989
ACM
We present algorithms that decompose an algebraic curve with rational coefficients in its defining bivariate equation into its irreducible real factors and its non-empty irreducib...