Sciweavers

3946 search results - page 214 / 790
» The computational complexity of choice sets
Sort
View
ATAL
2008
Springer
15 years 8 months ago
Coalitional skill games
We consider Coalitional Skill Games (CSGs), a simple model of cooperation among agents. This is a restricted form of coalitional games, where each agent has a set of skills that a...
Yoram Bachrach, Jeffrey S. Rosenschein
STACS
1993
Springer
15 years 10 months ago
A First-Order Isomorphism Theorem
We show that for most complexity classes of interest, all sets complete under rstorder projections (fops) are isomorphic under rst-order isomorphisms. That is, a very restricted v...
Eric Allender, José L. Balcázar, Nei...
IVS
2007
110views more  IVS 2007»
15 years 6 months ago
An automated approach for the optimization of pixel-based visualizations
During the last two decades, a wide variety of advanced methods for the visual exploration of large data sets have been proposed. For most of these techniques user interaction has...
Jörn Schneidewind, Mike Sips, Daniel A. Keim
198
Voted
GC
2007
Springer
15 years 6 months ago
Decompositions, Partitions, and Coverings with Convex Polygons and Pseudo-Triangles
We propose a novel subdivision of the plane that consists of both convex polygons and pseudotriangles. This pseudo-convex decomposition is significantly sparser than either conve...
Oswin Aichholzer, Clemens Huemer, S. Kappes, Betti...
DISOPT
2007
93views more  DISOPT 2007»
15 years 6 months ago
A polynomial time equivalence between DNA sequencing and the exact perfect matching problem
We investigate the computational complexity of a combinatorial problem that arises in DNA sequencing by hybridization: The input consists of an integer together with a set S of wo...
Jacek Blazewicz, Piotr Formanowicz, Marta Kasprzak...