page 60032 / 60054 » publications |
102
click to vote
JCSS
2008
14 years 9 months ago
2008
Given a Boolean function f, we study two natural generalizations of the certificate complexity C (f): the randomized certificate complexity RC (f) and the quantum certificate comp...
CORR
2007
Springer
14 years 9 months ago
2007
Springer
The k-forest problem is a common generalization of both the k-MST and the dense-k-subgraph problems. Formally, given a metric space on n vertices V , with m demand pairs ⊆ V × ...
NETWORK
2008
14 years 9 months ago
2008
Recently, WiMAX has been proposed as an attractive wireless communication technology for providing broadband access for metropolitan areas. Despite its salient features from the t...
EXPERT
2007
14 years 9 months ago
2007
s planners work at a higher abstraction level while it performs low-level, often-repetitive tasks. It also helps them produce a plan rapidly, explore alternative solutions, and cho...
GC
2007
Springer
14 years 9 months ago
2007
Springer
We localize and strengthen Katona’s idea of an edge-toughness to a local topological toughness. We disprove a conjecture of Katona concerning the connection between edgetoughnes...