1763 search results - page 162 / 353 » A Formalization of Polytime Functions |
134
click to vote
UAI
1994
15 years 5 months ago
1994
Heckerman (1993) defined causal independence in terms of a set of temporal conditional independence statements. These statements formalized certain types of causal interaction whe...
138
click to vote
EUROPAR
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. Algorithmic Skeletons offer high-level abstractions for parallel programming based on recurrent parallelism patterns. Patterns can be combined and nested into more comple...
144
click to vote
IANDC
2006
15 years 4 months ago
2006
It is well-known that stable models (as dI-domains, qualitative domains and coherence are not fully abstract for the language PCF. This fact is related to the existence of stable ...
165
click to vote
JAR
2008
15 years 4 months ago
2008
This article presents detailed implementations of quantifier elimination for both integer and real linear arithmetic for theorem provers. The underlying algorithms are those by Coo...
133
click to vote
JSW
2008
15 years 4 months ago
2008
A protocol for assuring the authenticity of information broadcasted over long periods of time is proposed. The protocol is based on time synchronization and uses one-way chains con...