1242 search results - page 15 / 249 » A Computational Complexity Theory in Membrane Computing |
ATAL
2007
Springer
15 years 3 months ago
2007
Springer
Agents engaged in noncooperative interaction may seek to achieve a Nash equilibrium; this requires that agents be aware of others’ rewards. Misinformation about rewards leads to...
IWPEC
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. We introduce a general notion of miniaturization of a problem that comprises the different miniaturizations of concrete problems considered so far. We develop parts of t...
ACMSE
2006
ACM
15 years 1 months ago
2006
ACM
In this paper, we offer an exposition of a theorem originally due to Adleman, Demarrais and Huang that shows that the quantum complexity class BQP (Bounded-error Quantum Polynomia...
EUROCRYPT
2004
Springer
15 years 3 months ago
2004
Springer
We revisit the following open problem in information-theoretic cryptography: Does the communication complexity of unconditionally secure computation depend on the computational com...
108
click to vote
LICS
2012
IEEE
13 years 1 days ago
2012
IEEE
—We show how to reliably compute fast-growing functions with timed-arc Petri nets and data nets. This construction provides ordinal-recursive lower bounds on the complexity of th...