MFCS
2010
Springer
13 years 10 months ago
2010
Springer
We consider evaluating one bilinear form defined by a sparse Ny × Nx matrix A having h entries on w pairs of vectors The model of computation is the semiring I/O-model with main ...
MFCS
2010
Springer
13 years 10 months ago
2010
Springer
Abstract. We address the strategy problem for parity games with partial information and observable colors, played on finite graphs of bounded graph complexity. We consider several...
MFCS
2010
Springer
13 years 10 months ago
2010
Springer
MFCS
2010
Springer
13 years 10 months ago
2010
Springer
We study observation-based strategies for partially-observable Markov decision processes (POMDPs) with parity objectives. An observationbased strategy relies on partial information...
MFCS
2010
Springer
13 years 10 months ago
2010
Springer
MFCS
2010
Springer
13 years 10 months ago
2010
Springer
We address the strategy problem for ω-regular two-player games with partial information, played on finite game graphs. We consider two different kinds of observability on a gene...
MFCS
2010
Springer
13 years 10 months ago
2010
Springer
We prove that coverability and termination are not primitive-recursive for lossy counter machines and for Reset Petri nets.
MFCS
2010
Springer
13 years 10 months ago
2010
Springer
The problem of finding a satisfying assignment for a 2-SAT formula that minimizes the number of variables that are set to 1 (min ones 2–sat) is NP-complete. It generalizes the w...
MFCS
2010
Springer
13 years 10 months ago
2010
Springer
Karchmer, Kushilevitz and Nisan formulated the formula size problem as an integer programming problem called the rectangle bound and introduced a technique called the LP bound, whi...
MFCS
2010
Springer
13 years 10 months ago
2010
Springer