Sciweavers

15254 search results - page 308 / 3051
» A k
Sort
View
COMBINATORICS
2007
55views more  COMBINATORICS 2007»
15 years 6 months ago
A Note on a Problem of Hilliker and Straus
For a prime p and a vector ¯α = (α1, . . . , αk) ∈ Zk p let f (¯α, p) be the largest n such that in each set A ⊆ Zp of n elements one can find x which has a unique repr...
Miroslawa Janczak
JCT
2006
93views more  JCT 2006»
15 years 6 months ago
Dominating sets in k-majority tournaments
A k-majority tournament T on a finite vertex set V is defined by a set of 2k - 1 linear orderings of V, with u v if and only if u lies above v in at least k of the orders. Motiva...
Noga Alon, Graham Brightwell, Hal A. Kierstead, Al...
GC
2007
Springer
15 years 6 months ago
An s -Hamiltonian Line Graph Problem
For an integer k > 0, a graph G is k-triangular if every edge of G lies in at least k distinct 3-cycles of G. In (J Graph Theory 11:399–407 (1987)), Broersma and Veldman propo...
Zhi-Hong Chen, Hong-Jian Lai, Wai-Chee Shiu, Deyin...
TIT
2010
96views Education» more  TIT 2010»
15 years 1 months ago
New bounds for restricted isometry constants
Abstract--This paper discusses new bounds for restricted isometry constants in compressed sensing. Let 8be an n2p real matrix and k be a positive integer with k n. One of the main...
T. Tony Cai, Lie Wang, Guangwu Xu
STACS
2010
Springer
16 years 1 months ago
Unsatisfiable Linear CNF Formulas Are Large and Complex
We call a CNF formula linear if any two clauses have at most one variable in common. We show that there exist unsatisfiable linear k-CNF formulas with at most 4k2 4k clauses, and ...
Dominik Scheder