2446 search results - page 319 / 490 » Choiceless Polynomial Time |
ATAL
2006
Springer
13 years 11 months ago
2006
Springer
We present a technique for reducing a normal-form (aka. (bi)matrix) game, O, to a smaller normal-form game, R, for the purpose of computing a Nash equilibrium. This is done by com...
CCS
2006
ACM
13 years 11 months ago
2006
ACM
Let us have an NLFSR with the feedback function g(x) and an LFSR with the generating polynomial f(x). The function g(x) is a Boolean function on the state of the NLFSR and the LFS...
CP
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Inspired by AND/OR search spaces for graphical models recently introduced, we propose to augment Ordered Decision Diagrams with AND nodes, in order to capture function de...
POPL
2000
ACM
13 years 11 months ago
2000
ACM
Systems that authenticate a user based on a shared secret (such as a password or PIN) normally allow anyone to query whether the secret is a given value. For example, an ATM machi...
STACS
2000
Springer
13 years 11 months ago
2000
Springer
We show that there is a set that is almost complete but not complete under polynomial-time many-one (p-m) reductions for the class E of sets computable in deterministic time 2lin ...