Sciweavers

9842 search results - page 93 / 1969
» Problem complexity
Sort
View
SIGMOD
2010
ACM
164views Database» more  SIGMOD 2010»
14 years 10 months ago
Efficiently evaluating complex boolean expressions
The problem of efficiently evaluating a large collection of complex Boolean expressions
Marcus Fontoura, Suhas Sadanandan, Jayavel Shanmug...
CLIMA
2010
14 years 10 months ago
Is Computational Complexity a Barrier to Manipulation?
When agents are acting together, they may need a simple mechanism to decide on joint actions. One possibility is to have the agents express their preferences in the form of a ballo...
Toby Walsh
ACL
2010
14 years 8 months ago
On the Computational Complexity of Dominance Links in Grammatical Formalisms
Dominance links were introduced in grammars to model long distance scrambling phenomena, motivating the definition of multiset-valued linear indexed grammars (MLIGs) by Rambow (19...
Sylvain Schmitz
JSAT
2007
63views more  JSAT 2007»
14 years 9 months ago
The Complexity of Some Subclasses of Minimal Unsatis able Formulas
This paper is concerned with the complexity of some natural subclasses of minimal unsatisfiable formulas. We show the DP –completeness of the classes of maximal and marginal mi...
Hans Kleine Büning, Xishun Zhao
ACSD
2005
IEEE
162views Hardware» more  ACSD 2005»
15 years 3 months ago
Complexity Results for Checking Distributed Implementability
We consider the distributed implementability problem as: Given a labeled transition system TS together with a distribution ∆ of its actions over a set of processes, does there ex...
Keijo Heljanko, Alin Stefanescu