134 search results - page 12 / 27 » Open Problems from CCCG 2006 |
IJNSEC
2006
13 years 7 months ago
2006
Zhong et al. formulated the problem of disclosing credentials (associated with privacy) for building trust in an open environment like Internet. Thus, one form of privacy-trust pr...
MST
2007
13 years 6 months ago
2007
Important variants of the Vertex Cover problem (among others, Connected Vertex Cover, Capacitated Vertex Cover, and Maximum Partial Vertex Cover) have been intensively studied in ...
CIE
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Graph isomorphism (GI) is one of the few remaining problems in NP whose complexity status couldn't be solved by classifying it as being either NP-complete or solvabl...
STOC
2006
ACM
14 years 7 months ago
2006
ACM
Producing a small DNF expression consistent with given data is a classical problem in computer science that occurs in a number of forms and has numerous applications. We consider ...
STOC
2006
ACM
14 years 7 months ago
2006
ACM
The width of a resolution proof is the maximal number of literals in any clause of the proof. The space of a proof is the maximal number of clauses kept in memory simultaneously if...