Skip to main navigation
Skip to search
Skip to main content
Princeton University Home
Help & FAQ
Home
Profiles
Research units
Facilities
Projects
Research output
Search by expertise, name or affiliation
Hardness of fully dense problems
Nir Ailon,
Noga Alon
Research output
:
Contribution to journal
›
Article
›
peer-review
22
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Hardness of fully dense problems'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Mathematics
Hardness
100%
NP-hard Problems
27%
Tournament
27%
Approximation Scheme
25%
Ranking
25%
Hypergraph
23%
Family
23%
Colouring
21%
Arc of a curve
20%
Upper bound
16%
Generalise
13%
Graph in graph theory
11%
Engineering & Materials Science
Hardness
78%
Coloring
39%
NP-hard
32%
Feedback
20%