GG
2008
Springer
13 years 8 months ago
2008
Springer
GG
2008
Springer
13 years 8 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 ...
GG
2008
Springer
13 years 8 months ago
2008
Springer
GG
2008
Springer
13 years 8 months ago
2008
Springer
GG
2008
Springer
13 years 8 months ago
2008
Springer
The tautology problem is the problem to prove the validity of statements. In this paper, we present a calculus for this undecidable problem on graphical conditions, prove its sound...
GG
2008
Springer
13 years 8 months ago
2008
Springer
In this paper we present meta-rules to express an infinite class of semantically related graph transformation rules in the context of pure topological modelling with G-maps. Our p...
GG
2008
Springer
13 years 8 months ago
2008
Springer
Abstract. Adaptive star grammars generalize well-known graph grammar formalisms based on hyperedge and node replacement while retaining, e.g., parseability and the commutativity an...
FOCS
2008
IEEE
13 years 8 months ago
2008
IEEE
We introduce another variant of Quantum MIP, where the provers do not share entanglement, the communication between the verifier and the provers is quantum, but the provers are u...
FOCS
2008
IEEE
13 years 8 months ago
2008
IEEE
Given a universe U of n elements and a weighted collection S of m subsets of U, the universal set cover problem is to a-priori map each element u ∈ U to a set S(u) ∈ S contain...
FOCS
2008
IEEE
13 years 8 months ago
2008
IEEE
In this paper we consider the following maximum budgeted allocation (MBA) problem: Given a set of m indivisible items and n agents; each agent i willing to pay bij on item j and w...