728 search results - page 1 / 146 » Compressing combinatorial objects |
IJCAI
2007
13 years 6 months ago
2007
ESSENCE is a new formal language for specifying combinatorial problems in a manner similar to natural rigorous specifications that use a mixture of natural language and discrete ...
CONSTRAINTS
2008
13 years 5 months ago
2008
Abstract. Essence is a formal language for specifying combinatorial problems, in a manner similar to natural rigorous specifications that use a mixture of natural language and disc...
EJC
2008
13 years 5 months ago
2008
We consider certain modules of the symmetric groups whose basis elements are called tabloids. As modules of the symmetric groups, some of these are isomorphic to Springer modules. ...
APPML
2006
13 years 5 months ago
2006
We show that a combinatorial question which has been studied in connection with lower bounds for the knapsack problem by Brimkov and Dantchev (2001) is related to threshold graphs...
JCT
2011
13 years 7 days ago
2011
We present a method for proving q-series identities by combinatorial telescoping in the sense that one can transform a bijection or classification of combinatorial objects into a ...