159 search results - page 26 / 32 » Soft lambda-Calculus: A Language for Polynomial Time Computa... |
IJCAI
2007
13 years 9 months ago
2007
We consider how to combine the preferences of multiple agents despite the presence of incompleteness and incomparability in their preference orderings. An agent’s preference orde...
JALC
2007
13 years 7 months ago
2007
We determine the complexity of learning problems for unary regular languages. We begin by investigating the minimum consistent dfa (resp. nfa) problem which is known not to be app...
POPL
2004
ACM
14 years 7 months ago
2004
ACM
We present a polynomial time randomized algorithm for global value numbering. Our algorithm is complete when conditionals are treated as non-deterministic and all operators are tr...
ICALP
2009
Springer
14 years 7 months ago
2009
Springer
The algebraic framework introduced in [Koutis, Proc. of the 35th ICALP 2008] reduces several combinatorial problems in parameterized complexity to the problem of detecting multili...
CP
2007
Springer
14 years 1 months ago
2007
Springer
Symmetry is an important factor in solving many constraint satisfaction problems. One common type of symmetry is when we have symmetric values. We can eliminate such value symmetr...