1278 search results - page 122 / 256 » The Complexity of Weighted Boolean |
FSTTCS
2004
Springer
14 years 3 months ago
2004
Springer
The class of visibly pushdown languages has been recently defined as a subclass of context-free languages with desirable closure properties and tractable decision problems. We stu...
TAMC
2010
Springer
14 years 3 months ago
2010
Springer
Unless we resolve the P vs NP question, we are unable to say whether there is an algorithm (acceptor) that accepts Boolean tautologies in polynomial time and does not accept non-ta...
ICALP
1998
Springer
14 years 2 months ago
1998
Springer
In the seventies, several classification schemes for the rational languages were proposed, based on the alternate use of certain operators (union, complementation, product and star...
ATVA
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. We present a first-order theory of (finite) sequences with integer elements, Presburger arithmetic, and regularity constraints, which can model significant properties of ...
ENTCS
2006
13 years 10 months ago
2006
We introduce a simple graph logic that supports specification of Quality of Service (QoS) properties of applications. The idea is that we are not only interested in representing w...