Sciweavers

999 search results - page 62 / 200
» On the Decidability of Functional Uncertainty
Sort
View
CADE
2003
Springer
14 years 9 months ago
A Principle for Incorporating Axioms into the First-Order Translation of Modal Formulae
In this paper we present a translation principle, called the axiomatic translation, for reducing propositional modal logics with background theories, including triangular propertie...
Renate A. Schmidt, Ullrich Hustadt
STOC
2002
ACM
107views Algorithms» more  STOC 2002»
14 years 9 months ago
Quantum lower bound for the collision problem
The collision problem is to decide whether a function X : {1, . . . , n} {1, . . . , n} is one-to-one or two-to-one, given that one of these is the case. We show a lower bound of...
Scott Aaronson
FROCOS
2007
Springer
14 years 2 months ago
Noetherianity and Combination Problems
In abstract algebra, a structure is said to be Noetherian if it does not admit infinite strictly ascending chains of congruences. In this paper, we adapt this notion to first-ord...
Silvio Ghilardi, Enrica Nicolini, Silvio Ranise, D...
RTA
2007
Springer
14 years 2 months ago
Intruders with Caps
In the analysis of cryptographic protocols, a treacherous set of terms is one from which an intruder can get access to what was intended to be secret, by adding on to the top of a ...
Siva Anantharaman, Paliath Narendran, Michaël...
PLDI
1997
ACM
14 years 28 days ago
Generational Garbage Collection and the Radioactive Decay Model
If a fixed exponentially decreasing probability distribution function is used to model every object’s lifetime, then the age of an object gives no information about its future ...
William D. Clinger, Lars Thomas Hansen