Theory of Periodically Specified Problems: Complexity and Approximability

Authors:
H. B. Hunt, III;M. V. Marathe;D. J. Rosenkrantz;R. E. Stearns
Affiliations:
-;-;-;-
Venue:
COCO '98 Proceedings of the Thirteenth Annual IEEE Conference on Computational Complexity
Year:
1998

Citing 0
Cited 3

Strongly-local reductions and the complexity/efficient approximability of algebra and optimization on abstract algebraic structures

Proceedings of the 2001 international symposium on Symbolic and algebraic computation
Towards a Predictive Computational Complexity Theory

ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Periodic Constraint Satisfaction Problems: Tractable Subclasses

Constraints

Quantified Score

Hi-index	0.00

Visualization

Abstract