Pages that link to "Item:Q787671"

The following pages link to Embedding partial Steiner triple systems is NP-complete (Q787671):

Displaying 18 items.

• The complexity of completing partial Latin squares (Q793029) (← links)
• Small embeddings of partial directed triple systems and partial triple systems with even \(\lambda\) (Q802563) (← links)
• The impact of search heuristics on heavy-tailed behaviour (Q850467) (← links)
• Solving non-Boolean satisfiability problems with stochastic local search: A comparison of encodings (Q862408) (← links)
• Completing partial commutative quasigroups constructed from partial Steiner triple systems is NP-complete (Q1044937) (← links)
• Completing small partial triple systems (Q1053018) (← links)
• Some NP-complete problems for hypergraph degree sequences (Q1076694) (← links)
• Quadratic leaves of maximal partial triple systems (Q1086567) (← links)
• The strong chromatic number of partial triple systems (Q1101122) (← links)
• On a class of completable partial edge-colourings (Q1186316) (← links)
• Triangulations of 3-way regular tripartite graphs of degree 4, with applications to orthogonal latin squares (Q1356443) (← links)
• Embeddings of partial Steiner triple systems (Q1826857) (← links)
• Existence and embeddings of partial Steiner triple systems of order ten with cubic leaves (Q1876677) (← links)
• \textsc{Conjure}: automatic generation of constraint models from problem specifications (Q2163883) (← links)
• Small Embeddings of Partial Steiner Triple Systems (Q3191441) (← links)
• An Evans-Style Result for Block Designs (Q5020831) (← links)
• Algorithm portfolios (Q5940819) (← links)
• On determining when small embeddings of partial Steiner triple systems exist (Q6187453) (← links)