16091 search results - page 2905 / 3219 » Solving |
166
click to vote
CHARME
2005
Springer
16 years 10 days ago
2005
Springer
Abstract. We define and study a quantitative generalization of the traditional boolean framework of model-based specification and verification. In our setting, propositions have...
180
click to vote
CICLING
2005
Springer
16 years 10 days ago
2005
Springer
We are presenting a description of the UNL initiative based on the Universal Networking Language (UNL). This language was conceived to be the support of the multilingual communicat...
174
click to vote
COCO
2005
Springer
16 years 10 days ago
2005
Springer
We study the complexity of solving succinct zero-sum games, i.e., the games whose payoff matrix M is given implicitly by a Boolean circuit C such that M(i, j) = C(i, j). We comple...
193
click to vote
COCO
2005
Springer
16 years 10 days ago
2005
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
216
click to vote
COCOON
2005
Springer
16 years 10 days ago
2005
Springer
Horizontal gene transfer (HGT) plays a major role in microbial genome diversification, and is claimed to be rampant among various groups of genes in bacteria. Further, HGT is a ma...