3454 search results - page 278 / 691 » Modern computer algebra |
199
click to vote
CSR
2007
Springer
16 years 25 days ago
2007
Springer
The maximum constraint satisfaction problem (Max CSP) is the following computational problem: an instance is a finite collection of constraints on a set of variables, and the goal...
214
click to vote
STACS
2007
Springer
16 years 23 days ago
2007
Springer
Fixed point equations x = f(x) over ω-continuous semirings can be seen as the mathematical foundation of interprocedural program analysis. The sequence 0, f(0), f2 (0), . . . conv...
144
click to vote
CW
2006
IEEE
16 years 22 days ago
2006
IEEE
Currently, in the development of business applications, difficulties occasionally arise between the customer side and the supplier side, causing delays and higher development cost...
191
click to vote
FOCS
2006
IEEE
16 years 22 days ago
2006
IEEE
We prove an upper bound, tight up to a factor of 2, for the number of vertices of level at most in an arrangement of n halfspaces in Rd , for arbitrary n and d (in particular, the...
163
click to vote
COCO
2005
Springer
16 years 6 days ago
2005
Springer
We continue the study of noncommutative polynomial identity testing initiated by Raz and Shpilka and present efficient algorithms for the following problems in the noncommutative...