551 search results - page 105 / 111 » Natural proofs |
COLING
1996
13 years 8 months ago
1996
This paper studies the computational complexity of disambiguation under probabilistic tree-grammars as in (Bod, 1992; Schabes and Waters, 1993). It presents a proof that the follo...
ATAL
2010
Springer
13 years 8 months ago
2010
Springer
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
BIRTHDAY
2010
Springer
13 years 8 months ago
2010
Springer
Many natural problems in computer science concern structures like graphs where elements are not inherently ordered. In contrast, Turing machines and other common models of computa...
CEC
2010
IEEE
13 years 8 months ago
2010
IEEE
An important challenge within hyper-heuristic research is to design search methodologies that work well, not only across different instances of the same problem, but also across di...
CRYPTO
2010
Springer
13 years 8 months ago
2010
Springer
Secure two-party authentication and key exchange are fundamental problems. Traditionally, the parties authenticate each other by means of their identities, using a public-key infr...