# 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} }

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

2

Twitter Mentions

#### Citations

##### Publications citing this paper.

SHOWING 1-3 OF 3 CITATIONS

## The 2CNF Boolean Formula Satisfiability Problem and the Linear Space Hypothesis

VIEW 1 EXCERPT

CITES METHODS

## 1 Motivational Discussion and Quick Overview 1 . 1 Space Complexity of Parameterized 2 SAT

VIEW 2 EXCERPTS

CITES METHODS & BACKGROUND

## Parameterized Graph Connectivity and Polynomial-Time Sub-Linear-Space Short Reductions - (Preliminary Report)

VIEW 3 EXCERPTS

CITES BACKGROUND

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 61 REFERENCES

## The complexity of optimization problems

VIEW 1 EXCERPT

## A Very Hard log-Space Counting Class

VIEW 1 EXCERPT

## On Uniformity within NC¹

VIEW 4 EXCERPTS

HIGHLY INFLUENTIAL