787 search results - page 11 / 158 » Polynomial Constants are Decidable |
RTA
1998
Springer
15 years 4 months ago
1998
Springer
We show that simultaneous rigid E-unification, or SREU for short, is decidable and in fact EXPTIME-complete in the case of one variable. This result implies that the fragment of i...
FOCS
2002
IEEE
15 years 4 months ago
2002
IEEE
We consider the problem of sampling almost uniformly from the set of contingency tables with given row and column sums, when the number of rows is a constant. Cryan and Dyer [3] h...
90
Voted
STOC
2001
ACM
16 years 1 days ago
2001
ACM
Optimal program slicing determines for a statement S in a program whether or not S affects a specified set of statements, given that all conditionals in are interpreted as non-d...
ICDT
2003
ACM
15 years 5 months ago
2003
ACM
We study extensions of first-order logic over the reals with different types of transitive-closure operators as query languages for constraint databases that can be described by...
103
click to vote
HYBRID
1995
Springer
15 years 3 months ago
1995
Springer
Abstract. In this paper we investigate the decidability of the reachability problem for planar non-linear hybrid systems. A planar hybrid system has the property that its state spa...