709 search results - page 64 / 142 » On LR(k)-Parsers of Polynomial Size |
SIGECOM
2005
ACM
15 years 3 months ago
2005
ACM
We study various computational aspects of solving games using dominance and iterated dominance. We first study both strict and weak dominance (not iterated), and show that checki...
SAGT
2009
Springer
15 years 2 months ago
2009
Springer
We study the convergence time of Nash dynamics in two classes of congestion games – constant player congestion games and bounded jump congestion games. It was shown by Ackermann ...
ALT
2000
Springer
15 years 2 months ago
2000
Springer
A conjunctive query problem in relational database theory is a problem to determine whether or not a tuple belongs to the answer of a conjunctive query over a database. Here, a tup...
PKC
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. In this paper, we fully break the Algebraic Surface Cryptosystem (ASC for short) proposed at PKC’2009 [3]. This system is based on an unusual problem in multivariate cr...
158
click to vote
VLDB
2002
ACM
15 years 10 months ago
2002
ACM
The view selection problem is to choose a set of views to materialize over a database schema, such that the cost of evaluating a set of workload queries is minimized and such that ...