13603 search results - page 366 / 2721 » On the Complexity of Computing Treelength |
166
click to vote
LICS
2008
IEEE
16 years 1 months ago
2008
IEEE
We show that the asymptotic complexity of uniformly generated (expressible in First-Order (FO) logic) propositional tautologies for the Nullstellensatz proof system (NS) as well a...
200
click to vote
STOC
2004
ACM
16 years 7 months ago
2004
ACM
Abstract. We give the first exponential separation between quantum and bounded-error randomized one-way communication complexity. Specifically, we define the Hidden Matching Proble...
207
click to vote
VIZSEC
2004
Springer
16 years 27 days ago
2004
Springer
We describe a framework for managing network attack graph complexity through interactive visualization, which includes hierarchical aggregation of graph elements. Aggregation coll...
193
click to vote
COCO
2010
Springer
15 years 11 months ago
2010
Springer
Abstract—We consider two natural extensions of the communication complexity model that are inspired by distributed computing. In both models, two parties are equipped with synchr...
213
click to vote
INFOCOM
2008
IEEE
16 years 1 months ago
2008
IEEE
Abstract—Complex networks, modeled as large graphs, received much attention during these last years. However, data on such networks is only available through intricate measuremen...