8196 search results - page 88 / 1640 » Computational Modeling and Complexity Science |
FOCS
1997
IEEE
15 years 2 months ago
1997
IEEE
d abstract) Eyal Kushilevitz Rafail Ostrovskyy Technion Bellcore We establish the following, quite unexpected, result: replication of data for the computational Private Informatio...
FOCS
2006
IEEE
15 years 3 months 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...
DLT
2009
14 years 7 months ago
2009
Abstract. We analyze Hmelevskii's theorem, which states that the general solutions of constant-free equations on three unknowns are expressible by a finite collection of formu...
MFCS
1993
Springer
15 years 1 months ago
1993
Springer
We prove (for fixed k) that at least 1 k−1 (n 2 ) − O(n) equality tests and no more than 2 k (n 2 )+O(n) equality tests are needed in the worst case to determine whether a giv...
AUTOMATICA
1999
14 years 9 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...