A bounded-error quantum polynomial-time algorithm for two graph bisection problems (Q747789): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enhanced quantum searching via entanglement and partial diffusion / rank
 
Normal rank
Property / cites work
 
Property / cites work: A framework for solving VLSI graph layout problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: MAX-CUT and MAX-BISECTION are NP-hard on unit disk graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact combinatorial algorithm for minimum graph bisection / rank
 
Normal rank
Property / cites work
 
Property / cites work: The RPR2 rounding technique for semidefinite programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An $\mathcal{O}(n^4)$ Time Algorithm to Compute the Bisection Width of Solid Grid Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simplified NP-complete graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for graph partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Min-cut clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Automatic Method of Solving Discrete Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of a Planar Separator Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for the max-bisection and the disjoint 2-catalog segmentation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5743406 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997537 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Evolutionary Graph Partitioning / rank
 
Normal rank

Latest revision as of 22:49, 10 July 2024

scientific article
Language Label Description Also known as
English
A bounded-error quantum polynomial-time algorithm for two graph bisection problems
scientific article

    Statements

    A bounded-error quantum polynomial-time algorithm for two graph bisection problems (English)
    0 references
    0 references
    19 October 2015
    0 references
    quantum algorithm
    0 references
    graph bisection
    0 references
    MAX-bisection
    0 references
    MIN-bisection
    0 references
    amplitude amplification
    0 references
    BQP
    0 references
    NP-hard
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references