Results 271 to 280 of about 4,919,639 (299)
Some of the next articles are maybe not open access.
Russian Mathematical Surveys, 1993
The following theorem is proved: Let integers be written in the cells of an integer lattice. Then there exists a square with sides parallel to the lines of the lattice such that the sum of the numbers inside is divisible by a given number \(n\). Generalizations are discussed.
Belov, A. Ya., Okhitin, S. V.
openaire +1 more source
The following theorem is proved: Let integers be written in the cells of an integer lattice. Then there exists a square with sides parallel to the lines of the lattice such that the sum of the numbers inside is divisible by a given number \(n\). Generalizations are discussed.
Belov, A. Ya., Okhitin, S. V.
openaire +1 more source
Reducibility Among Combinatorial Problems
1972Throughout the 1960s I worked on combinatorial optimization problems including logic circuit design with Paul Roth and assembly line balancing and the traveling salesman problem with Mike Held. These experiences made me aware that seemingly simple discrete optimization problems could hold the seeds of combinatorial explosions.
openaire +3 more sources
A Combinatorial Proof for Stockhausen's Problem
SIAM Journal on Discrete Mathematics, 1997Summary: We consider problems in the enumeration of sequences suggested by the problem of determining the number of ways of performing a piano composition (Klavierstück XI) by Karlheinz Stockhausen. An explicit formula and a combinatorial proof for the general problem are given.
openaire +2 more sources
On the Computational Complexity of Combinatorial Problems
Networks, 1975A large class of classical combinatorial problems, including most of the difficult problems in the literature of network flows and computational graph theory, are shown to be equivalent, in the sense that either all or none of them can be solved in polynomial time.
openaire +3 more sources
A Combinatorial Problem in Matching
Journal of the London Mathematical Society, 1969Kalbfleisch, J. G., Stanton, R. G.
openaire +1 more source
A Problem in Combinatorial Geometry
Journal of the London Mathematical Society, 1976openaire +2 more sources