Search Sciweavers | Sciweavers

1998 search results - page 26 / 400

» Complexity of the Cover Polynomial

click to vote

WAOA
2005
Springer

170views Algorithms» more WAOA 2005»

On Approximating Restricted Cycle Covers

14 years 3 months ago

Download wwwhome.math.utwente.nl

A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set...

Bodo Manthey

claim paper

Read More »

click to vote

COCO
2009
Springer

124views Algorithms» more COCO 2009»

The Complexity of the Annihilating Polynomial

14 years 4 months ago

Download www.math.ias.edu

Neeraj Kayal

claim paper

Read More »

click to vote

CSR
2009
Springer

96views Theoretical Computer Science» more CSR 2009»

Lower Bounds for the Determinantal Complexity of Explicit Low Degree Polynomials

14 years 4 months ago

Download itcs.tsinghua.edu.cn

Maurice J. Jansen

claim paper

Read More »

click to vote

MFCS
2004
Springer

89views Theoretical Computer Science» more MFCS 2004»

Polynomial Time Approximation Schemes and Parameterized Complexity

14 years 3 months ago

Download faculty.cs.tamu.edu

Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia

claim paper

Read More »

click to vote

ICALP
2010
Springer

102views Programming Languages» more ICALP 2010»

Exponential Time Complexity of the Permanent and the Tutte Polynomial

14 years 2 months ago

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers