3172 search results - page 90 / 635 » On the Random-Self-Reducibility of Complete Sets |
174
click to vote
KR
2004
Springer
16 years 7 days ago
2004
Springer
We extend graded modal logic (GML) to a logic that captures the concept of majority. We provide an axiomatization for majority logic, MJL, and sketch soundness and completeness pr...
170
click to vote
MEMBRANE
2004
Springer
16 years 7 days ago
2004
Springer
We proved that two classes of Communicative P systems with 3 membranes and with minimal cooperation, namely P systems with symport/antiport rules of size 1 and and P systems with s...
143
click to vote
FSTTCS
2001
Springer
15 years 11 months ago
2001
Springer
For any class C und closed under NC1 reductions, it is shown that all sets complete for C under first-order (equivalently, Dlogtimeuniform AC0 ) reductions are isomorphic under ...
203
click to vote
EJC
2002
15 years 6 months ago
2002
In this short note the neighbourhood graph of a Cayley graph is considered. It has as nodes a symmetric generating set of a finitely-generated group . Two nodes are connected by a...
160
click to vote
CVIU
1999
15 years 6 months ago
1999
We show that we can effectively fit arbitrarily complex animation models to noisy data extracted from ordinary face images Our approach is based on least-squares adjustment, using...