Abstract We prove, using a non-standard complexity assumption, that any language in NP has a 1-round (that is, the verifier sends a message to the prover, and the prover sends a me...
Results are presented of a simulation which mimics an evolutionary learning process for small networks. Special features of these networks include a high recurrency, a transition ...