1653 search results - page 148 / 331 » Computer science and game theory |
STACS
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. This paper solves the unambiguity and the sequentiality problem for polynomially ambiguous min-plus automata. This result is proved through a decidable algebraic characte...
CSR
2006
Springer
15 years 1 months ago
2006
Springer
In this paper we classify several algorithmic problems in group theory in the classes PZK and SZK (problems with perfect/statistical zero-knowledge proofs respectively). Prior to ...
WG
2000
Springer
15 years 1 months ago
2000
Springer
Several practical instances of network design and location theory problems require the network to satisfy multiple constraints. In this paper, we address graph-theoretic problems t...
110
click to vote
WMP
2000
15 years 1 months ago
2000
This paper is an attempt to summarize the basic elements of the multiset theory. We begin by describing multisets and the operations between them, then we present hybrid sets and t...
GG
2008
Springer
14 years 11 months ago
2008
Springer
In this paper we give a category-based characterization of recognizability. A recognizable subset of arrows is defined via a functor into the category of relations on sets, which ...