3172 search results - page 83 / 635 » On the Random-Self-Reducibility of Complete Sets |
105
click to vote
COLCOM
2007
IEEE
15 years 7 months ago
2007
IEEE
— While multicast has been studied extensively in many domains such as content streaming and file sharing, there is little research applying it to synchronous collaborations invo...
80
Voted
CONCUR
2007
Springer
15 years 7 months ago
2007
Springer
It is well known that bisimulation on µ-expressions cannot be finitely axiomatised in equational logic. Complete axiomatisations such as those of Milner and Bloom/´Esik necessar...
101
Voted
ENDM
2007
15 years 23 days ago
2007
Providing a complete description of the stable set polytopes of claw-free graphs is a longstanding open problem since almost twenty years. Eisenbrandt et al. recently achieved a b...
121
click to vote
AAAI
2006
15 years 2 months ago
2006
Recent research shows that SAT (propositional satisfiability) techniques can be employed to build efficient systems to compute answer sets for logic programs. ASSAT and CMODELS ar...
98
Voted
CORR
2006
Springer
15 years 25 days ago
2006
Springer
Once the set of finite graphs is equipped with an algebra structure (arising from the definition of operations that generalize the concatenation of words), one can define the noti...