13603 search results - page 1 / 2721 » On the Computational Complexity of Cut-Reduction |
LICS
2008
IEEE
15 years 4 months ago
2008
IEEE
Using appropriate notation systems for proofs, cutreduction can often be rendered feasible on these notations. Explicit bounds can be given. Developing a suitable notation system ...
COMPLEXITY
2006
14 years 10 months ago
2006
JC
2007
14 years 10 months ago
2007
We extend the lower bounds on the complexity of computing Betti numbers proved in [6] to complex algebraic varieties. More precisely, we first prove that the problem of deciding ...
122
click to vote
STOC
2012
ACM
13 years 24 days ago
2012
ACM
We consider submodular optimization problems, and provide a general way of translating oracle inapproximability results arising from the symmetry gap technique to computational co...