Sciweavers

7840 search results - page 311 / 1568
» On generalized Ramsey numbers
Sort
View
FFA
2006
116views more  FFA 2006»
15 years 6 months ago
Amorphic association schemes with negative Latin square-type graphs
Applying results from partial difference sets, quadratic forms, and recent results of Brouwer and Van Dam, we construct the first known amorphic association scheme with negative La...
James A. Davis, Qing Xiang
IJNSEC
2006
61views more  IJNSEC 2006»
15 years 6 months ago
Is There a Shortage of Primes for Cryptography?
Cryptographic algorithms often prescribe the use of primes whose length in bits is a power of 2. Recently, we proved that for m > 1, there is no prime number with 2m significan...
Samuel S. Wagstaff Jr.
CORR
2007
Springer
75views Education» more  CORR 2007»
15 years 6 months ago
Polyhedral representation conversion up to symmetries
We give a short survey on computational techniques which can be used to solve the representation conversion problem for polyhedra up to symmetries. In particular we discuss decompo...
David Bremner, Mathieu Dutour Sikiric, Achill Sch&...
JSYML
2008
66views more  JSYML 2008»
15 years 6 months ago
Flat algebras and the translation of universal Horn logic to equational logic
We describe which subdirectly irreducible flat algebras arise in the variety generated by an arbitrary class of flat algebras with absorbing bottom element. This is used to give an...
Marcel Jackson
MP
2006
121views more  MP 2006»
15 years 6 months ago
Approximate fixed-rank closures of covering problems
Consider a 0/1 integer program min{cT x : Ax b, x {0, 1}n } where A is nonnegative. We show that if the number of minimal covers of Ax b is polynomially bounded, then there is ...
Daniel Bienstock, Mark Zuckerberg