3172 search results - page 414 / 635 » On the Random-Self-Reducibility of Complete Sets |
190
click to vote
TOPNOC
2008
15 years 6 months ago
2008
Message Sequence Charts (MSCs) are a well known language for specifying scenarios that describe how different actors (e.g., system components, people, or organizations) interact. M...
159
click to vote
TPLP
2008
15 years 6 months ago
2008
We present in this paper a first-order axiomatization of an extended theory T of finite or infinite trees, built on a signature containing an infinite set of function symbols and ...
181
click to vote
CPC
2004
15 years 6 months ago
2004
We consider boolean functions over n variables. Any such function can be represented (and computed) by a complete binary tree with and or or in the internal nodes and a literal in...
162
click to vote
MLMTA
2003
15 years 8 months ago
2003
— This work shows comparatively the capacity of five Fuzzy Lattice Neurocomputing (FLN) classifiers. The mechanics of the five classifiers are illustrated geometrically on the pl...
150
click to vote
IANDC
2008
15 years 6 months ago
2008
We introduce two resource-bounded Baire category notions on small complexity classes such as P, QUASIPOLY, SUBEXP and PSPACE and on probabilistic classes such as BPP, which differ...