120 search results - page 16 / 24 » Theorems for Free! |
87
Voted
ISLPED
2003
ACM
15 years 7 months ago
2003
ACM
Distributed wireless ad-hoc networks (DWANs) pose numerous technical challenges. Among them, two are widely considered as crucial: autonomous localized operation and minimization ...
LATIN
1992
Springer
15 years 5 months ago
1992
Springer
A reversible automaton is a finite (possibly incomplete) automaton in which each letter induces a partial one-to-one map from the set of states into itself. We give four non-trivi...
117
click to vote
MLQ
2010
15 years 7 days ago
2010
: It is well known that, in a topological space, the open sets can be characterized using filter convergence. In ZF (Zermelo-Fraenkel set theory without the Axiom of Choice), we c...
190
click to vote
IFM
2010
Springer
14 years 11 months ago
2010
Springer
Safe is a first-order eager functional language with facilities for programmer controlled destruction and copying of data structures. It provides also regions, i.e. disjoint parts...
101
click to vote
CSL
2005
Springer
15 years 7 months ago
2005
Springer
The proof system G∗ 0 of the quantified propositional calculus corresponds to NC1 , and G∗ 1 corresponds to P, but no formula-based proof system that corresponds log space rea...