Sciweavers

37 search results - page 5 / 8
» mst 2008
Sort
View
MST
2008
155views more  MST 2008»
14 years 10 months ago
On Aperiodic and Star-Free Formal Power Series in Partially Commuting Variables
Formal power series over non-commuting variables have been investigated as representations of the behavior of automata with multiplicities. Here we introduce and investigate the co...
Manfred Droste, Paul Gastin
MST
2008
150views more  MST 2008»
14 years 10 months ago
Coinduction for Exact Real Number Computation
This paper studies coinductive representations of real numbers by signed digit streams and fast Cauchy sequences. It is shown how the associated coinductive principle can be used ...
Ulrich Berger, Tie Hou
MST
2008
124views more  MST 2008»
14 years 10 months ago
Complexity of Clausal Constraints Over Chains
We investigate the complexity of the satisfiability problem of constraints over finite totally ordered domains. In our context, a clausal constraint is a disjunction of inequaliti...
Nadia Creignou, Miki Hermann, Andrei A. Krokhin, G...
MST
2008
94views more  MST 2008»
14 years 10 months ago
Partial Bi-immunity, Scaled Dimension, and NP-Completeness
The Turing and many-one completeness notions for NP have been previously separated under measure, genericity, and bi-immunity hypotheses on NP. The proofs of all these results rel...
John M. Hitchcock, Aduri Pavan, N. V. Vinodchandra...
MST
2010
140views more  MST 2010»
14 years 8 months ago
Approximability of Clausal Constraints
We study a family of problems, called Maximum Solution (Max Sol), where the objective is to maximise a linear goal function over the feasible integer assignments to a set of variab...
Peter Jonsson, Gustav Nordh