Uniform-Circuit and Logarithmic-Space Approximations of Refined Combinatorial Optimization Problems

@article{Yamakami2013UniformCircuitAL,
  title={Uniform-Circuit and Logarithmic-Space Approximations of Refined Combinatorial Optimization Problems},
  author={Tomoyuki Yamakami},
  journal={ArXiv},
  year={2013},
  volume={abs/1601.01118}
}
  • Tomoyuki Yamakami
  • Published 2013
  • Computer Science, Mathematics
  • ArXiv
  • A significant progress has been made in the past three decades over the study of combinatorial NP optimization problems and their associated optimization and approximate classes, such as NPO, PO, APX (or APXP), and PTAS. Unfortunately, a collection of problems that are simply placed inside the P-solvable optimization class PO never have been studiously analyzed regarding their exact computational complexity. To improve this situation, the existing framework based on polynomial-time… CONTINUE READING

    Citations

    Publications citing this paper.

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 61 REFERENCES

    Structure in Approximation Classes

    The complexity of optimization problems

    VIEW 1 EXCERPT

    Logspace Optimization Problems and Their Approximability Properties

    • Till Tantau
    • Mathematics, Computer Science
    • Theory of Computing Systems
    • 2007

    Logspace Optimisation Problems and their Approximation Properties

    • Till Tantau
    • Mathematics, Computer Science
    • Electronic Colloquium on Computational Complexity
    • 2003

    A Very Hard log-Space Counting Class

    VIEW 1 EXCERPT

    On Uniformity within NC¹

    VIEW 4 EXCERPTS
    HIGHLY INFLUENTIAL