Sciweavers

16666 search results - page 276 / 3334

» Descriptive and Computational Complexity

131

MFCS
2004
Springer

89views Theoretical Computer Science» more MFCS 2004»

Polynomial Time Approximation Schemes and Parameterized Complexity

15 years 12 months ago

Polynomial Time Approximation Schemes and Parameterized Complexity

Download faculty.cs.tamu.edu

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

claim paper

Read More »

127

ICTCS
2003
Springer

63views Theoretical Computer Science» more ICTCS 2003»

The Complexity of Checking Consistency of Pedigree Information and Related Problems

15 years 11 months ago

The Complexity of Checking Consistency of Pedigree Information and Related Problems

Download www.brics.dk

Luca Aceto, Jens A. Hansen, Anna Ingólfsd&o...

claim paper

Read More »

132

CF
2010
ACM

112views Applied Computing» more CF 2010»

Scalable simulation of complex network routing policies

15 years 11 months ago

Scalable simulation of complex network routing policies

Download www.cs.colostate.edu

Andrew Ian Stone, Steve DiBenedetto, Michelle Mill...

claim paper

Read More »

145

TAMC
2010
Springer

239views Applied Computing» more TAMC 2010»

Complexity of Paths, Trails and Circuits in Arc-Colored Digraphs

15 years 11 months ago

Complexity of Paths, Trails and Circuits in Arc-Colored Digraphs

Download www.ic.uff.br

Laurent Gourvès, Adria Lyra, Carlos A. J. M...

claim paper

Read More »

172

CSR
2006
Springer

169views Theoretical Computer Science» more CSR 2006»

Complexity of Polynomial Multiplication over Finite Fields

15 years 10 months ago

Complexity of Polynomial Multiplication over Finite Fields

Download www.cs.technion.ac.il

Let Mq (n ) denote the number of multiplications required to compute the coefficients of the product of two polynomials of degree n over a q -element field by means of bilinear alg...

Michael Kaminski

claim paper

Read More »

« Prev « First page 276 / 3334 Last » Next »