Search Sciweavers | Sciweavers

13603 search results - page 1 / 2721

» On the computational complexity of bridgecard

click to vote

COMPLEXITY
2006

87views more COMPLEXITY 2006»

Complexity, parallel computation and statistical physics

13 years 5 months ago

Download people.umass.edu

Jonathan Machta

claim paper

Read More »

click to vote

JC
2007

130views more JC 2007»

On the complexity of deciding connectedness and computing Betti numbers of a complex algebraic variety

13 years 4 months ago

Download math-www.uni-paderborn.de

We extend the lower bounds on the complexity of computing Betti numbers proved in [6] to complex algebraic varieties. More precisely, we ﬁrst prove that the problem of deciding ...

Peter Scheiblechner

claim paper

Read More »

click to vote

STOC
2012
ACM

221views Algorithms» more STOC 2012»

From query complexity to computational complexity

11 years 7 months ago

Download theory.stanford.edu

We consider submodular optimization problems, and provide a general way of translating oracle inapproximability results arising from the symmetry gap technique to computational co...

Shahar Dobzinski, Jan Vondrák

claim paper

Read More »

click to vote

FOCM
2007

76views more FOCM 2007»

The Complexity of Computing the Hilbert Polynomial of Smooth Equidimensional Complex Projective Varieties

13 years 4 months ago

Download math-www.uni-paderborn.de

Peter Bürgisser, Martin Lotz

claim paper

Read More »