13306 search results - page 434 / 2662 » Theoretical Computer Science |
190
click to vote
STACS
2000
Springer
15 years 11 months ago
2000
Springer
We prove that several global properties (global convergence, global asymptotic stability, mortality, and nilpotence) of particular classes of discrete time dynamical systems are un...
196
Voted
STACS
2000
Springer
15 years 11 months ago
2000
Springer
Abstract. Block codes are first viewed as finite state automata represented as trellises. A technique termed subtrellis overlaying is introduced with the object of reducing decoder...
191
click to vote
FOCS
1995
IEEE
15 years 11 months ago
1995
IEEE
We establish a variety of combinatorial bounds on the tradeo s inherent in reconstructing strings using few rounds of a given number of substring queries per round. These results ...
181
click to vote
FOCS
1995
IEEE
15 years 11 months ago
1995
IEEE
We prove that if strong pseudorandom number generators exist, then the class of languages that have polynomialsized circuits (P/poly) is not measurable within exponential time, in...
182
click to vote
RTA
1995
Springer
15 years 11 months ago
1995
Springer
In this paper we study normalization properties of rewrite systems that are typeable using intersection types with and with sorts. We prove two normalization properties of typeable...