Sciweavers

128 search results - page 6 / 26
» An Implicit Characterization of PSPACE
Sort
View
FUIN
2000
71views more  FUIN 2000»
14 years 10 months ago
The Nondeterministic Information Logic NIL is PSPACE-complete
The nondeterministic information logic NIL has been introduced by Orlowska and Pawlak in 1984 as a logic for reasoning about total information systems with the similarity, the forw...
Stéphane Demri
FSTTCS
2010
Springer
14 years 8 months ago
Expressiveness of streaming string transducers
Streaming string transducers [1] define (partial) functions from input strings to output strings. A streaming string transducer makes a single pass through the input string and us...
Rajeev Alur, Pavol Cerný
TSP
2012
13 years 5 months ago
Parametrization of Linear Systems Using Diffusion Kernels
—Modeling natural and artificial systems has played a key role in various applications and has long been a task that has drawn enormous efforts. In this work, instead of explori...
Ronen Talmon, Dan Kushnir, Ronald R. Coifman, Isra...
COCO
2005
Springer
99views Algorithms» more  COCO 2005»
15 years 3 months ago
On the Complexity of Succinct Zero-Sum Games
We study the complexity of solving succinct zero-sum games, i.e., the games whose payoff matrix M is given implicitly by a Boolean circuit C such that M(i, j) = C(i, j). We comple...
Lance Fortnow, Russell Impagliazzo, Valentine Kaba...
TACS
2001
Springer
15 years 2 months ago
Non-structural Subtype Entailment in Automata Theory
Decidability of non-structural subtype entailment is a long standing open problem in programming language theory. In this paper, we apply automata theoretic methods to characterize...
Joachim Niehren, Tim Priesnitz