504 search results - page 59 / 101 » The Complexity of Symmetry-Breaking Formulas |
136
click to vote
STOC
1989
ACM
15 years 8 months ago
1989
ACM
Division is a fundamental problem for arithmetic and algebraic computation. This paper describes Boolean circuits of bounded fan-in for integer division nding reciprocals that...
152
click to vote
PLDI
2009
ACM
15 years 11 months ago
2009
ACM
We show that recursive programs where variables range over finite domains can be effectively and efficiently analyzed by describing the analysis algorithm using a formula in a ...
141
click to vote
COCO
2010
Springer
15 years 8 months ago
2010
Springer
The last decade has seen a revival of interest in pebble games in the context of proof complexity. Pebbling has proven to be a useful tool for studying resolution-based proof syst...
160
Voted
CSCLP
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. Over the last decade, first-order constraints have been efficiently used in the artificial intelligence world to model many kinds of complex problems such as: scheduling,...
161
click to vote
ICDE
2010
IEEE
15 years 11 months ago
2010
IEEE
Abstract— Developing a full-fledged cost-based XQuery optimizer is a fairly complex task. Nowadays, there is little knowledge concerning suitable cost formulae and optimization ...