976 search results - page 107 / 196 » The Complexity of Timetable Construction Problems |
TIT
2008
13 years 8 months ago
2008
This paper presents a construction of Slepian group codes from affine reflection groups. The solution to the initial vector and nearest distance problem is presented for all irred...
CORR
2004
Springer
13 years 8 months ago
2004
Springer
ACL2 was used to prove properties of two simplification procedures. The procedures differ in complexity but solve the same programming problem that arises in the context of a reso...
BSL
2000
13 years 8 months ago
2000
We recall the notions of weak and strong Euler characteristics on a first order structure and make explicit the notion of a Grothendieck ring of a structure. We define partially or...
ECCC
2000
13 years 8 months ago
2000
Abstract. We suggest a candidate one-way function using combinatorial constructs such as expander graphs. These graphs are used to determine a sequence of small overlapping subsets...
CORR
1998
Springer
13 years 8 months ago
1998
Springer
Abstract. Consider a system F of n polynomial equations in n unknowns, over an algebraically closed field of arbitrary characteristic. We present a fast method to find a point in...