Non deterministic polynomial optimization problems and their approximations (Q1152215): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0304-3975(81)90081-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2056090079 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational power of pushdown automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198057 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of theorem-proving procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4161330 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Near-Optimal Graph Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: `` Strong '' NP-Completeness Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4077442 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of a Planar Separator Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: General approximation algorithms for some arithmetical combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4125769 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4146536 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4164569 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computationally Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Problems: Reductibility and Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: P-Complete Approximation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Problems: Reductibility and Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relationships between nondeterministic and deterministic tape complexities / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Monte-Carlo Test for Primality / rank
 
Normal rank

Latest revision as of 12:13, 13 June 2024

scientific article
Language Label Description Also known as
English
Non deterministic polynomial optimization problems and their approximations
scientific article

    Statements

    Non deterministic polynomial optimization problems and their approximations (English)
    0 references
    0 references
    1981
    0 references
    0 references
    0 references