13603 search results - page 89 / 2721 » On the Complexity of Computing Treelength |
134
click to vote
LATINCRYPT
2010
15 years 2 months ago
2010
We consider the following problem: can we construct constant-round zero-knowledge proofs (with negligible soundness) for NP assuming only the existence of one-way permutations? We...
144
click to vote
ESAW
2009
Springer
15 years 2 months ago
2009
Springer
009), which constitutes an abstraction of the various aspects of a MAS, generalizing the AGR approach and incorporating the institutional work of Searle (Searle 1995). This model i...
156
click to vote
CPHYSICS
2011
14 years 7 months ago
2011
The inner silicon detector of the Compact Muon Solenoid experiment (CMS) at CERN’s LHC consists of 16 588 modules. Charged-particle tracks in the detector are used to improve th...
138
click to vote
NAR
2011
14 years 7 months ago
2011
Binary subcomplexes in proteins database (BISC) is a new protein–protein interaction (PPI) database linking up the two communities most active in their characterization: structu...
178
click to vote
FGCS
2002
15 years 4 months ago
2002
As the practice of science moves beyond the single investigator due to the complexity of the problems that now dominate science, large collaborative and multi-institutional teams ...