Sciweavers

4324 search results - page 315 / 865
» A Generalized Representer Theorem
Sort
View
JCT
2007
140views more  JCT 2007»
15 years 6 months ago
Homomorphisms and edge-colourings of planar graphs
We conjecture that every planar graph of odd-girth 2k + 1 admits a homomorphism to Cayley graph C(Z2k+1 2 , S2k+1), with S2k+1 being the set of (2k + 1)vectors with exactly two co...
Reza Naserasr
CORR
2002
Springer
166views Education» more  CORR 2002»
15 years 6 months ago
Quantum Time-Space Tradeoffs for Sorting
Abstract: Although a quantum state requires exponentially many classical bits to describe, the laws of quantum mechanics impose severe restrictions on how that state can be accesse...
Hartmut Klauck
JSYML
1998
61views more  JSYML 1998»
15 years 6 months ago
Superdestructibility: A Dual to Laver's Indestructibility
Abstract. After small forcing, any <κ-closed forcing will destroy the supercompactness and even the strong compactness of κ. In a delightful argument, Laver [L78] proved that ...
Joel David Hamkins, Saharon Shelah
NDJFL
1998
100views more  NDJFL 1998»
15 years 6 months ago
Failure of Interpolation in Combined Modal Logics
We investigate transfer of interpolation in such combinations of modal logic which lead to interaction of the modalities. Combining logics by taking products often blocks transfer...
Maarten Marx, Carlos Areces
FOCS
2010
IEEE
15 years 4 months ago
The Coin Problem and Pseudorandomness for Branching Programs
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...
Joshua Brody, Elad Verbin