1717 search results - page 138 / 344 » A Computable Spectral Theorem |
149
Voted
TCS
2010
14 years 11 months ago
2010
The theorem of factorization forests of Imre Simon shows the existence of nested factorizations -- `a la Ramsey -- for finite words. This theorem has important applications in sem...
153
click to vote
ACL2
2006
ACM
15 years 10 months ago
2006
ACM
We introduce the logical story behind file input in ACL2 and discuss the types of theorems that can be proven about filereading operations. We develop a low level library for re...
146
click to vote
ACL2
2006
ACM
15 years 10 months ago
2006
ACM
We describe a new procedure for verifying ACL2 properties about finite state machines (FSMs) using satisfiability (SAT) solving. We present an algorithm for converting ACL2 conj...
130
click to vote
IFIP
2004
Springer
15 years 10 months ago
2004
Springer
Abstract We propose an alternative notion of asymptotic behaviors for the study of type2 computational complexity. Since the classical asymptotic notion (for all but finitely many...
131
click to vote
CONCUR
1999
Springer
15 years 8 months ago
1999
Springer
Abstract. We present an in-depth discussion of the relationships between synchrony and asynchrony. Simple models of both paradigms are presented, and we state theorems which guaran...