Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

68

Voted

AUTOMATICA
2000

72views more AUTOMATICA 2000»

A survey of computational complexity results in systems and control

15 years 3 months ago

A survey of computational complexity results in systems and control

Download www.inma.ucl.ac.be

Vincent D. Blondel, John N. Tsitsiklis

Real-time Traffic

AUTOMATICA 2000 |

claim paper

Related Content

» Some Results on the Expressive Power and Complexity of LSCs

» On extracting computations from propositional proofs a survey

» ReRep Computational detection of repetitive sequences in genome survey sequences GSS

» On the complexity of computational problems regarding distributions a survey

» A Survey of Distributed Biometric Authentication Systems

» Complexity of Boolean Functions on PRAMs Lower Bound Techniques

» New results on the computability and complexity of points to analysis

» Perils of Transitive Trust in the Domain Name System

» Results of a Study on InvoiceReading Systems in Germany

Post Info
More Details (n/a)

Added	17 Dec 2010
Updated	17 Dec 2010
Type	Journal
Year	2000
Where	AUTOMATICA
Authors	Vincent D. Blondel, John N. Tsitsiklis

Comments (0)