4940 search results - page 731 / 988 » On the Complexity of Universal Programs |
166
click to vote
ICALP
2005
Springer
16 years 2 days ago
2005
Springer
Abstract: The quantum adversary method is one of the most versatile lower-bound methods for quantum algorithms. We show that all known variants of this method are equivalent: spect...
188
click to vote
IMA
2005
Springer
16 years 1 days ago
2005
Springer
Abstract. An increasingly important design constraint for software running on ubiquitous computing devices is security, particularly against physical methods such as side-channel a...
171
click to vote
SAS
2005
Springer
16 years 1 days ago
2005
Springer
A technique for generating invariant polynomial inequalities of bounded degree is presented using the abstract interpretation framework. It is based on overapproximating basic semi...
152
click to vote
SAS
2005
Springer
16 years 1 days ago
2005
Springer
Abstract. In his seminal paper [5], Granger presents an analysis which infers linear congruence relations between integer variables. For affine programs without guards, his analys...
155
click to vote
UC
2005
Springer
16 years 22 hour ago
2005
Springer
In this paper we present WebPS, an open-source web-enabled simulator for P systems, and a P accelerator for parallelization of the existing sequential simulators. The simulator is ...