2157 search results - page 432 / 432 » Binary ant algorithm |
148
click to vote
ESA
2009
Springer
16 years 11 days ago
2009
Springer
We study a special class of binary trees. Our results have implications on Maker/Breaker games and SAT: We disprove a conjecture of Beck on positional games and construct an unsati...
176
Voted
FSTTCS
2009
Springer
16 years 10 days ago
2009
Springer
We study the branching program complexity of the tree evaluation problem, introduced in [BCM+09a] as a candidate for separating NL from LogCFL. The input to the problem is a roote...