On the computational complexity of the minimum committee problem (Q928677): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10852-006-9056-z / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2074464358 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5754127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A threshold of ln <i>n</i> for approximating set cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2783476 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Basic Geometry of Voting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4261789 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The elements of statistical learning. Data mining, inference, and prediction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3923952 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the hardness of approximating minimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The densest hemisphere problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3236254 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:45, 28 June 2024

scientific article
Language Label Description Also known as
English
On the computational complexity of the minimum committee problem
scientific article

    Statements