307 search results - page 10 / 62 » On Equations over Sets of Integers |
IPCO
2007
15 years 18 days ago
2007
Let A be the edge-node incidence matrix of a bipartite graph G = (U, V ; E), I be a subset the nodes of G, and b be a vector such that 2b is integral. We consider the following mi...
BIRTHDAY
2009
Springer
15 years 6 months ago
2009
Springer
We consider a class of arithmetic equations over the complete lattice of integers (extended with −∞ and ∞) and provide a polynomial time algorithm for computing least solutio...
CIE
2005
Springer
15 years 4 months ago
2005
Springer
Abstract. We define a general concept of a network of analogue modules connected by channels, processing data from a metric space A, and operating with respect to a global continu...
127
click to vote
FROCOS
2009
Springer
15 years 5 months ago
2009
Springer
Motivated by applications in software verification, we explore automated reasoning about the non-disjoint combination of theories of infinitely many finite structures, where the...
102
click to vote
VLSID
2002
IEEE
15 years 11 months ago
2002
IEEE
Satisfiability of complex word-level formulas often arises as a problem in formal verification of hardware designs described at the register transfer level (RTL). Even though most...