Complement, Complexity, and Symmetric Representation (Q2949722): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: 3-coloring in time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact and approximate bandwidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for MAX-CUT in sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Which problems have strongly exponential complexity? / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Almost Linear-Time Algorithm for the Dense Subset-Sum Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Partitions with Applications to the Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4681162 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for maximum independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Power indices and easier hard problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Open problems around exact algorithms / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1142/s0129054115500318 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2220626745 / rank
 
Normal rank

Latest revision as of 11:10, 30 July 2024

scientific article
Language Label Description Also known as
English
Complement, Complexity, and Symmetric Representation
scientific article

    Statements

    Complement, Complexity, and Symmetric Representation (English)
    0 references
    0 references
    2 October 2015
    0 references
    symmetric representation
    0 references
    NP-complete
    0 references
    power index
    0 references
    clique
    0 references
    independent set
    0 references
    vertex cover
    0 references
    partition
    0 references
    sub-exponential time
    0 references

    Identifiers