5100 search results - page 46 / 1020 » The Linear Complexity of a Graph |
CISS
2008
IEEE
14 years 2 months ago
2008
IEEE
—In this paper, we propose a low complexity linear multiuser beamforming system for the multiple-input multipleoutput (MIMO) broadcast channel. We consider the specific case of ...
FOSSACS
2007
Springer
13 years 11 months ago
2007
Springer
In a seminal paper from 1985, Sistla and Clarke showed that satisfiability for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the set of tempora...
ICALP
2009
Springer
14 years 8 months ago
2009
Springer
DLT
2008
13 years 9 months ago
2008
We prove that, for the uniform distribution over all sets X of m (that is a fixed integer) non-empty words whose sum of lengths is n, DX , one of the usual deterministic automata r...
ACTA
2004
13 years 7 months ago
2004
We study the complexity of satisfiability and model-checking of the linear-time temporal logic with past (pltl). More precisely, we consider several fragments of pltl, depending o...