656 search results - page 45 / 132 » Graph Theoretical Characterization and Computation of Answer... |
GG
2004
Springer
14 years 1 months ago
2004
Springer
We show how edge-labelled graphs can be used to represent first-order logic formulae. This gives rise to recursively nested structures, in which each level of nesting corresponds ...
KDD
2003
ACM
14 years 8 months ago
2003
ACM
Large and complex graphs representing relationships among sets of entities are an increasingly common focus of interest in data analysis--examples include social networks, Web gra...
RANDOM
1997
Springer
13 years 11 months ago
1997
Springer
Most research on resource-bounded measure and randomness has focused on the uniform probability density, or Lebesgue measure, on {0, 1}∞ ; the study of resource-bounded measure ...
FOCS
2004
IEEE
13 years 11 months ago
2004
IEEE
A desirable goal for cryptographic protocols is to guarantee security when the protocol is composed with other protocol instances. Universally Composable (UC) protocols provide th...
WG
1992
Springer
13 years 11 months ago
1992
Springer
The recognition complexityof ordered set properties is considered, i.e.how many questions have to be asked to decide if an unknown ordered set has a prescribed property. We prove ...