Skip to search formSkip to main contentSkip to account menu

3-partition problem

Known as: 3-partition, Three processor problem, Unary 3-partition 
The 3-partition problem is an NP-complete problem in computer science. The problem is to decide whether a given multiset of integers can be… 
Wikipedia (opens in a new tab)

Related topics

Related topics

8 relations
3-dimensional matchingComputer scienceList of NP-complete problemsMichael Garey

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
On the orthogonal arrays of parameters OA(1536, 13, 2, 7) and related
With a computer-aided approach based on the connection with equitable partitions, we establish the uniqueness of the orthogonal… 
2014
2014
A scheduling model and complexity proof for autonomous vehicle sequencing problem at isolated intersections
In this paper, we study the complexity of an autonomous vehicle sequencing problem under the framework of Autonomous Intersection… 
2013
2013
The Mondshein Sequence
Canonical orderings [STOC’88, FOCS’92] have been used as a key tool in graph drawing, graph encoding and visibility… 
2013
2013
Relaxation of 3-partition instances
The 3-partition problem admits a straightforward formulation as a 0-1 Integer Linear Program (ILP). We investigate problem… 
2009
2009
Algebraic properties of structured context-free languages: old approaches and novel developments
The historical research line on the algebraic properties of structured CF languages initiated by McNaughton's Parenthesis… 
2008
2008
AnO(k2n2) algorithm to find ak-partition in ak-connected graph
Although there are polynomial algorithms of finding a 2-partition or a 3-partition for a simple undirected 2-connected or 3… 
2007
2007
The size of minimum 3‐trees
A 3‐uniform hypergraph (3‐graph) is said to be tight, if for any 3‐partition of its vertex set there is a transversal triple. We… 
2006
2006
Job Sequencing with Exponential Functions of Processing Times
We study single machine scheduling problems, where processing times of the jobs are exponential functions of their start times… 
2005
2005
Fuzzy Partition Technique in Three-Level Thresholding
  • 2005
  • Corpus ID: 18034618
Two-level thresholding segments a gray scale image into two parts: object and background. This two-class segmentation is not… 
2004
2004
Algorithmes d'ordonnancement pour les nouveaux supports d'exécution. (Scheduling algorithms for parallel platforms)
Les nouveaux supports d'execution que sont les grilles de processeurs apparaissent aujourd'hui comme une alternative… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)