Sciweavers

220 search results - page 14 / 44
» tcs 2008
Sort
View
TCS
2008
13 years 9 months ago
The complexity of deciding reachability properties of distributed negotiation schemes
Distributed negotiation schemes offer one approach to agreeing an allocation of resources among a set of individual agents. Such schemes attempt to agree a distribution via a sequ...
Paul E. Dunne, Yann Chevaleyre
TCS
2008
13 years 9 months ago
The NP-hardness of finding a directed acyclic graph for regular resolution
Let R be a resolution refutation, given as a sequence of clauses without explicit description of the underlying dag. Then, it is NPcomplete to decide whether R is a regular resolu...
Samuel R. Buss, Jan Hoffmann 0002
TCS
2008
13 years 9 months ago
A note on the problem of reporting maximal cliques
Reporting the maximal cliques of a graph is a fundamental problem arising in many areas. This note bridges the gap between three papers addressing this problem: the original paper...
Frédéric Cazals, Chinmay Karande
TCS
2002
13 years 9 months ago
Topics in the theory of DNA computing
DNA computing, or, more generally, molecular computing, is an exciting fast developing interdisciplinary area. Research in this area concerns theory, experiments, and applications...
Martyn Amos, Gheorghe Paun, Grzegorz Rozenberg, Ar...
TCS
2002
13 years 9 months ago
An example of a computable absolutely normal number
The first example of an absolutely normal number was given by Sierpinski in 1916, twenty years before the concept of computability was formalized. In this note we give a recursive...
Verónica Becher, Santiago Figueira