Sciweavers

29908 search results - page 442 / 5982
» On the Complexity of
Sort
View
ENTCS
2008
102views more  ENTCS 2008»
15 years 7 months ago
Soft Linear Logic and Polynomial Complexity Classes
We describe some results inspired to Lafont's Soft Linear Logic (SLL) which is a subsystem of second-order linear logic with restricted rules for exponentials, correct and co...
Marco Gaboardi, Jean-Yves Marion, Simona Ronchi De...
CORR
2006
Springer
87views Education» more  CORR 2006»
15 years 7 months ago
Low Complexity Algorithms for Linear Recurrences
We consider two kinds of problems: the computation of polynomial and rational solutions of linear recurrences with coefficients that are polynomials with integer coefficients; ind...
Alin Bostan, Frédéric Chyzak, Bruno ...
CORR
2007
Springer
132views Education» more  CORR 2007»
15 years 7 months ago
Matroid Pathwidth and Code Trellis Complexity
We relate the notion of matroid pathwidth to the minimum trellis state-complexity (which we term trellis-width) of a linear code, and to the pathwidth of a graph. By reducing from ...
Navin Kashyap
CORR
2007
Springer
155views Education» more  CORR 2007»
15 years 7 months ago
Algebraic Distributed Differential Space-Time Codes with Low Decoding Complexity
—The differential encoding/decoding setup introduced by Kiran et al, Oggier-Hassibi and Jing-Jafarkhani for wireless relay networks that use codebooks consisting of unitary matri...
G. Susinder Rajan, B. Sundar Rajan
JSAT
2006
126views more  JSAT 2006»
15 years 7 months ago
Complexity Results for Quantified Boolean Formulae Based on Complete Propositional Languages
Several propositional fragments have been considered so far as target languages for knowledge compilation and used for improving computational tasks from major AI areas (like infe...
Sylvie Coste-Marquis, Daniel Le Berre, Florian Let...