2412 search results - page 173 / 483 » Which Problems Have Strongly Exponential Complexity |
105
Voted
CMOT
1998
15 years 3 months ago
1998
A programming language which is optimized for modelling multi-agent interaction within articulated social structures such as organizations is described with several examples of it...
132
Voted
ECCC
2011
14 years 7 months ago
2011
We show that two complexity classes introduced about two decades ago are equal. ReachUL is the class of problems decided by nondeterministic log-space machines which on every inpu...
137
Voted
ASIACRYPT
2000
Springer
15 years 8 months ago
2000
Springer
We consider a problem which was stated in a request for comments made by NIST in the FIPS97 document. The question is the following: Can we have a digital signature public key infr...
117
Voted
AAAI
2006
15 years 5 months ago
2006
Identifying intrinsic structures in large networks is a fundamental problem in many fields, such as engineering, social science and biology. In this paper, we are concerned with c...
132
Voted
GECCO
2010
Springer
15 years 8 months ago
2010
Springer
Negative selection algorithms are immune-inspired classifiers that are trained on negative examples only. Classification is performed by generating detectors that match none of ...