Search Sciweavers | Sciweavers

13603 search results - page 1 / 2721

» On the Complexity of Computing Treelength

click to vote

MFCS
2007
Springer

109views Theoretical Computer Science» more MFCS 2007»

On the Complexity of Computing Treelength

14 years 1 months ago

Download www.ii.uib.no

We resolve the computational complexity of determining the treelength of a graph, thereby solving an open problem of Dourisboure and Gavoille, who introduced this parameter, and a...

Daniel Lokshtanov

claim paper

Read More »

click to vote

STOC
2012
ACM

221views Algorithms» more STOC 2012»

From query complexity to computational complexity

11 years 9 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

JCSS
2011

95views more JCSS 2011»

The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory

13 years 1 months ago

Download www.cs.rutgers.edu

Eric Allender, Michal Koucký, Detlef Ronneb...

claim paper

Read More »

click to vote

ENTCS
2011

131views more ENTCS 2011»

Computational Complexity in Non-Turing Models of Computation: The What, the Why and the How

13 years 1 months ago

Download users.ox.ac.uk

We preliminarily recap what is meant by complexity and non-Turing computation, by way of explanation of our title, ‘Computational Complexity in Non-Turing Models of Computation�...

Ed Blakey

claim paper

Read More »

click to vote

PAAPP
2007

105views more PAAPP 2007»

Computational complexity of weighted splitting schemes on parallel computers

13 years 6 months ago

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers