1368 search results - page 193 / 274 » Generalized Rook Polynomials |
137
click to vote
TAMC
2007
Springer
16 years 4 days ago
2007
Springer
For generalized Reed-Solomon codes, it has been proved [7] that the problem of determining if a received word is a deep hole is coNP-complete. The reduction relies on the fact that...
170
click to vote
TCC
2007
Springer
16 years 4 days ago
2007
Springer
Abstract. We establish new lower bounds and impossibility results for noninteractive zero-knowledge proofs and arguments with set-up assumptions. – For the common random string m...
161
click to vote
BROADNETS
2006
IEEE
16 years 3 days ago
2006
IEEE
— We introduce a new algorithmic framework for advanced channel reservation in ultra high speed networks, called Graded Channel Reservation (GCR). GCR allows users to specify min...
162
click to vote
FOCS
2006
IEEE
16 years 2 days ago
2006
IEEE
Given an undirected hypergraph and a subset of vertices S ⊆ V with a specified root vertex r ∈ S, the STEINER ROOTED-ORIENTATION problem is to find an orientation of all the...
161
click to vote
IPPS
2006
IEEE
16 years 1 days ago
2006
IEEE
Users and developers of grid applications have access to increasing numbers of resources. While more resources generally mean higher capabilities for an application, they also rai...