Search Sciweavers | Sciweavers

1379 search results - page 14 / 276

» The Complexity of the Annihilating Polynomial

145

click to vote

MFCS
2004
Springer

89views Theoretical Computer Science» more MFCS 2004»

Polynomial Time Approximation Schemes and Parameterized Complexity

16 years 28 days ago

Download faculty.cs.tamu.edu

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

claim paper

Read More »

137

click to vote

ICALP
2010
Springer

102views Programming Languages» more ICALP 2010»

Exponential Time Complexity of the Permanent and the Tutte Polynomial

16 years 11 days ago

Download www2.informatik.hu-berlin.de

Holger Dell, Thore Husfeldt, Martin Wahlen

claim paper

Read More »

169

click to vote

PODS
2009
ACM

98views Database» more PODS 2009»

XPath evaluation in linear time with polynomial combined complexity

16 years 7 days ago

Download www.mimuw.edu.pl

Pawel Parys

claim paper

Read More »

click to vote

CORR
2006
Springer

70views Education» more CORR 2006»

The complexity of class polynomial computation via floating point approximations

15 years 7 months ago

Download www.math.leidenuniv.nl

Andreas Enge

claim paper

Read More »

146

click to vote

CPC
2006

79views more CPC 2006»

On the Complexity of Computing the Tutte Polynomial of Bicircular Matroids

15 years 7 months ago

Sciweavers

Explore & Download

Productivity Tools

Sciweavers