4117 search results - page 41 / 824 » On the Satisfiability of Complex Constraints |
108
click to vote
ICFEM
2009
Springer
14 years 9 months ago
2009
Springer
In this paper we continue the study of a strict extension of the Computation Tree Logic, called graded-CTL, recently introduced by the same authors. This new logic augments the sta...
DAC
2008
ACM
16 years 25 days ago
2008
ACM
Boolean function bi-decomposition is a fundamental operation in logic synthesis. A function f(X) is bi-decomposable under a variable partition XA, XB, XC on X if it can be written...
134
click to vote
STOC
2010
ACM
15 years 4 months ago
2010
ACM
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...
SIGECOM
2010
ACM
15 years 1 days ago
2010
ACM
Cut games and party affiliation games are well-known classes of potential games. Schaffer and Yannakakis showed that computing pure Nash equilibrium in these games is PLScomplete....
SCHOLARPEDIA
2008
14 years 10 months ago
2008
ABSTRACT. We discuss a special eigenstate of the quantized periodic CalogeroMoser system associated to a root system. This state has the property that its eigenfunctions, when rega...