Amanote Research
Register
Sign In
Random Sampling and Approximation of MAX-CSP Problems
doi 10.1145/509943.509945
Full Text
Open PDF
Abstract
Available in
full text
Date
January 1, 2002
Authors
Noga Alon
W. Fernandez de la Vega
Ravi Kannan
Marek Karpinski
Publisher
ACM Press
Related search
Sampling Sub-Problems of Heterogeneous Max-Cut Problems and Approximation Algorithms
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Approximation by Max-Product Operators
Fasciculi Mathematici
Sampling of Probability Measures in the Convex Order and Approximation of Martingale Optimal Transport Problems
SSRN Electronic Journal
Max-Product Shepard Approximation Operators
Journal of Advanced Computational Intelligence and Intelligent Informatics
Computer Vision
Pattern Recognition
Human-Computer Interaction
Artificial Intelligence
Stratified Random Sampling
Random Polytopes, Convex Bodies, and Approximation
Beliefs Underlying Random Sampling
Memory and Cognition
Arts
Neuropsychology
Cognitive Psychology
Humanities
Physiological Psychology
Medicine
Experimental
Min–max and Min–max Regret Versions of Combinatorial Optimization Problems: A Survey
European Journal of Operational Research
Information Systems
Simulation
Management Science
Management
Computer Science
Modeling
Operations Research
Separate, Measure and Conquer: Faster Polynomial-Space Algorithms for Max 2-CSP and Counting Dominating Sets
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
