Sciweavers

IPL
2008
78views more  IPL 2008»
13 years 3 months ago
Resource-bounded measure on probabilistic classes
We extend Lutz's resource-bounded measure to probabilistic classes, and obtain notions of resource-bounded measure on probabilistic complexity classes such as BPE and BPEXP. ...
Philippe Moser
IPL
2008
59views more  IPL 2008»
13 years 3 months ago
Dynamic bottleneck optimization for k-edge and 2-vertex connectivity
Orestis Telelis, Vassilis Zissimopoulos
IPL
2008
58views more  IPL 2008»
13 years 3 months ago
Two fixed-parameter algorithms for Vertex Covering by Paths on Trees
Jiong Guo, Rolf Niedermeier, Johannes Uhlmann
IPL
2008
118views more  IPL 2008»
13 years 3 months ago
Slicing for modern program structures: a theory for eliminating irrelevant loops
Slicing is a program transformation technique with numerous applications, as it allows the user to focus on the parts of a program that are relevant for a given purpose. Ideally, ...
Torben Amtoft
IPL
2008
110views more  IPL 2008»
13 years 3 months ago
Reduction of stochastic parity to stochastic mean-payoff games
Abstract. A stochastic graph game is played by two players on a game graph with probabilistic transitions. We consider stochastic graph games with -regular winning conditions speci...
Krishnendu Chatterjee, Thomas A. Henzinger
IPL
2008
65views more  IPL 2008»
13 years 3 months ago
On the fixed-parameter tractability of parameterized model-checking problems
In this note, we show, through the use of examples, how generic results for proving fixed-parameter tractability which apply to restricted classes of structures can sometimes be m...
Iain A. Stewart
IPL
2008
99views more  IPL 2008»
13 years 3 months ago
A CKY parser for picture grammars
We study the complexity of the membership or parsing problem for pictures generated by a family of picture grammars: Siromoney's Context-Free Kolam Array grammars (coincident...
Stefano Crespi-Reghizzi, Matteo Pradella
IPL
2008
98views more  IPL 2008»
13 years 3 months ago
On the number of Go positions on lattice graphs
We use transfer matrix methods to determine bounds for the numbers of legal Go positions for various numbers of players on some planar lattice graphs, including square lattice gra...
Graham Farr, Johannes Schmidt
IPL
2008
82views more  IPL 2008»
13 years 3 months ago
On fully orientability of 2-degenerate graphs
Suppose that D is an acyclic orientation of the graph G. An arc of D is dependent if its reversal creates a directed cycle. Let d(D) denote the number of dependent arcs in D. Defi...
Hsin-Hao Lai, Gerard J. Chang, Ko-Wei Lih
IPL
2008
59views more  IPL 2008»
13 years 3 months ago
Faster index for property matching
Costas S. Iliopoulos, Mohammad Sohel Rahman