976 search results - page 50 / 196 » The Complexity of Timetable Construction Problems |
STOC
2010
ACM
14 years 6 months ago
2010
ACM
We initiate a direction for proving lower bounds on the size of non-commutative arithmetic circuits. This direction is based on a connection between lower bounds on the size of no...
ETFA
2008
IEEE
14 years 3 months ago
2008
IEEE
— There is a need to replace existing mechanical and electromechanical systems with new ones, where functionality will be mainly implemented by software. The traditional approach...
KDD
2007
ACM
14 years 9 months ago
2007
ACM
In this paper, we introduce and study the Minimum Consistent Subset Cover (MCSC) problem. Given a finite ground set X and a constraint t, find the minimum number of consistent sub...
OOIS
1994
Springer
14 years 1 months ago
1994
Springer
The business of software development is solving problems. Following Polya, we can increase our ability to solve problems by focusing directly on problems themselves, on their part...
SIAMCOMP
2011
13 years 4 months ago
2011
Abstract. In the 2nd Annual FOCS (1961), Chao-Kong Chow proved that every Boolean threshold function is uniquely determined by its degree-0 and degree-1 Fourier coefficients. These...