Pages that link to "Item:Q793029"
From MaRDI portal
The following pages link to The complexity of completing partial Latin squares (Q793029):
Displaying 49 items.
- On the completability of incomplete orthogonal Latin rectangles (Q267209) (← links)
- Completing partial Latin squares with one nonempty row, column, and symbol (Q281630) (← links)
- Characterization of extreme points of multi-stochastic tensors (Q302261) (← links)
- Iterated local search with Trellis-neighborhood for the partial Latin square extension problem (Q525111) (← links)
- Consensus models: computational complexity aspects in modern approaches to the list coloring problem (Q638544) (← links)
- Completion of partial Latin hypercube designs: NP-completeness and inapproximability (Q683750) (← links)
- Reliable assignments of processors to tasks and factoring on matroids (Q685664) (← links)
- An improved approximation algorithm for the partial Latin square extension problem. (Q703265) (← links)
- The Sudoku completion problem with rectangular hole pattern is NP-complete (Q713152) (← links)
- Complexity of token swapping and its variants (Q722547) (← links)
- On avoiding some families of arrays (Q764884) (← links)
- Multigraph realizations of degree sequences: Maximization is easy, minimization is hard (Q957360) (← links)
- On the completability of incomplete Latin squares (Q966163) (← links)
- Problems from CGCS Luminy, May 2007 (Q966173) (← links)
- A note on the hardness of Skolem-type sequences (Q972331) (← links)
- The complexity of constructing gerechte designs (Q1010920) (← links)
- List edge multicoloring in graphs with few cycles (Q1029053) (← links)
- Estimating the number of Latin rectangles by the fast simulation method (Q1040349) (← links)
- Completing partial commutative quasigroups constructed from partial Steiner triple systems is NP-complete (Q1044937) (← links)
- Approximating latin square extensions (Q1293881) (← links)
- Triangulations of 3-way regular tripartite graphs of degree 4, with applications to orthogonal latin squares (Q1356443) (← links)
- List-edge-colouring planar graphs with precoloured edges (Q1621065) (← links)
- The fewest clues problem (Q1623268) (← links)
- A randomized tabu search-based approach for perfect stranger matching in economic experiments (Q1670213) (← links)
- Exact sampling algorithms for Latin squares and Sudoku matrices via probabilistic divide-and-conquer (Q1679226) (← links)
- The power of propagation: when GAC is enough (Q1701225) (← links)
- Randomized post-optimization of covering arrays (Q1761502) (← links)
- An effective greedy heuristic for the social golfer problem (Q1761919) (← links)
- An improved SAT formulation for the social golfer problem (Q1761920) (← links)
- Avoiding and extending partial edge colorings of hypercubes (Q2122768) (← links)
- A census of critical sets based on non-trivial autotopisms of Latin squares of order up to five (Q2131453) (← links)
- Completion and deficiency problems (Q2200922) (← links)
- On NP-hardness of the clique partition -- independence number gap recognition and related problems (Q2368935) (← links)
- A Latin square autotopism secret sharing scheme (Q2630718) (← links)
- On the complexity of certain completion problems (Q2716514) (← links)
- A Bayesian approach to tackling hard computational problems. (Preliminary report) (Q2741540) (← links)
- A characterization of odd-hole inequalities related to Latin squares (Q2868928) (← links)
- Cropper's question and Cruse's theorem about partial Latin squares (Q3087609) (← links)
- A new algorithm for enumerating all possible Sudoku squares (Q3178156) (← links)
- (Q4677898) (← links)
- Restricted completion of sparse partial Latin squares (Q5222548) (← links)
- Constructing and embedding mutually orthogonal Latin squares: reviewing both new and existing results (Q5858496) (← links)
- (Q5863474) (← links)
- Exploring the complexity boundary between coloring and list-coloring (Q5896984) (← links)
- Exploring the complexity boundary between coloring and list-coloring (Q5899384) (← links)
- Extension of some edge graph problems: standard, parameterized and approximation complexity (Q6048430) (← links)
- Flexibility of triangle‐free planar graphs (Q6055413) (← links)
- A massively parallel evolutionary algorithm for the partial Latin square extension problem (Q6106593) (← links)
- Computing random \(r\)-orthogonal Latin squares (Q6606227) (← links)
