1021 search results - page 47 / 205 » On the generalized Navier-Stokes equations |
DATE
2005
IEEE
14 years 3 months ago
2005
IEEE
A class of discrete event synthesis problems can be reduced to solving language equations F • X ⊆ S, where F is the fixed component and S the specification. Sequential synthes...
APAL
2008
13 years 10 months ago
2008
We develop and study the complexity of propositional proof systems of varying strength extending resolution by allowing it to operate with disjunctions of linear equations instead ...
QUESTA
2007
13 years 9 months ago
2007
: In this paper we study the Lindley-type equation W = max{0, B − A − W}. Its main characteristic is that it is a non-increasing monotone function in its main argument W. Our m...
JUCS
2010
13 years 8 months ago
2010
: A language L is the orthogonal concatenation of languages L1 and L2 if every word of L can be written in a unique way as a concatenation of a word in L1 and a word in L2. The not...
OL
2010
13 years 8 months ago
2010
Abstract. We consider the system of m linear equations in n integer variables Ax = d and give sufficient conditions for the uniqueness of its integer solution x ∈ {−1,1}n by r...