922 search results - page 165 / 185 » On a Generalization of the Stone-Weierstrass Theorem |
108
click to vote
STOC
2010
ACM
15 years 11 months ago
2010
ACM
We initiate a direction for proving lower bounds on the size of non-commutative arithmetic circuits. This direction is based on a connection between lower bounds on the size of no...
126
click to vote
JCT
2010
15 years 10 days ago
2010
A linear equation L is called k-regular if every k-coloring of the positive integers contains a monochromatic solution to L. Richard Rado conjectured that for every positive intege...
112
click to vote
STOC
1997
ACM
15 years 6 months ago
1997
ACM
Shor has showed how to perform fault tolerant quantum computation when the probability for an error in a qubit or a gate, η, decays with the size of the computation polylogarithmi...
139
click to vote
FSTTCS
1999
Springer
15 years 6 months ago
1999
Springer
We present a (the rst?) sound and relatively complete Hoare logic for a simple imperative programming language including mutually recursive procedures with call-by-value parameters...
137
click to vote
TPHOL
1998
IEEE
15 years 6 months ago
1998
IEEE
In this paper we illustrate the use of formal methods in the development of a benchmark application we call the Village Telephone System which is characteristic of a class of netwo...