1717 search results - page 247 / 344 » A Computable Spectral Theorem |
148
click to vote
FOCS
2010
IEEE
15 years 3 months ago
2010
IEEE
The Coin Problem is the following problem: a coin is given, which lands on head with probability either 1/2 + or 1/2 - . We are given the outcome of n independent tosses of this co...
150
click to vote
ICALP
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. The use of passwords in security protocols is particularly delicate because of the possibility of off-line guessing attacks. We study password-based protocols in the cont...
156
click to vote
FOCS
2009
IEEE
16 years 4 days ago
2009
IEEE
Polynomial time preprocessing to reduce instance size is one of the most commonly deployed heuristics to tackle computationally hard problems. In a parameterized problem, every in...
155
click to vote
ASM
2004
ASM
15 years 10 months ago
2004
ASM
For a while it seemed possible to pretend that all interaction between an algorithm and its environment occurs inter-step, but not anymore. Andreas Blass, Benjamin Rossman and the ...
188
click to vote
FOCS
2003
IEEE
15 years 10 months ago
2003
IEEE
A directed multigraph is said to be d-regular if the indegree and outdegree of every vertex is exactly d. By Hall’s theorem one can represent such a multigraph as a combination ...