19320 search results - page 316 / 3864 » On the complexity of computing determinants |
197
click to vote
FOCS
2006
IEEE
16 years 23 days ago
2006
IEEE
We show that 2-tag systems efficiently simulate Turing machines. As a corollary we find that the small universal Turing machines of Rogozhin, Minsky and others simulate Turing ma...
187
Voted
FCT
2005
Springer
16 years 7 days ago
2005
Springer
We review a recently introduced computation model for streaming and external memory data. An important feature of this model is that it distinguishes between sequentially reading (...
252
click to vote
GI
2007
Springer
15 years 10 months ago
2007
Springer
Abstract: Modeling systems with Statecharts has become standard practice in the design of reactive embedded devices. However, the modeling of realistic applications with the paradi...
138
click to vote
JC
2006
15 years 6 months ago
2006
We prove upper bounds on the order and degree of the polynomials involved in a resolvent representation of the prime differential ideal associated with a polynomial differential s...
185
click to vote
AUTOMATICA
1999
15 years 6 months ago
1999
In this paper, we consider simple classes of nonlinear systems and prove that basic questions related to their stability and controllability are either undecidable or computationa...