CSR 2009 - PDF Preprint Papers

CSR 2009 International Computer Science Symposium

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed CSR-2009 Paper

click to vote

CSR
2009
Springer

178views Theoretical Computer Science» more CSR 2009»

Approximability of the Maximum Solution Problem for Certain Families of Algebras

14 years 1 months ago

Download www.lix.polytechnique.fr

We study the approximability of the maximum solution problem. This problem is an optimisation variant of the constraint satisfaction problem and it captures a wide range of interes...

Peter Jonsson, Johan Thapper

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	178	Approximability of the Maximum Solution Problem for Certain Families of Algebras	claim
2	161	The Budgeted Unique Coverage Problem and Color-Coding	claim
3	149	Partitioning Graphs into Connected Parts	claim
4	140	On the Complexity of Matroid Isomorphism Problems	claim
5	131	Characterizing the Existence of Optimal Proof Systems and Complete Sets for Promise Classes	claim
6	121	On Random Ordering Constraints	claim
7	120	One-Nonterminal Conjunctive Grammars over a Unary Alphabet	claim
8	119	New Plain-Exponential Time Classes for Graph Homomorphism	claim
9	116	Kolmogorov Complexity and Model Selection	claim
10	112	Approximability Distance in the Space of H-Colourability Problems	claim
11	112	Simulation of Arithmetical Circuits by Branching Programs with Preservation of Constant Width and Syntactic Multilinearity	claim
12	111	Variations on Muchnik's Conditional Complexity Theorem	claim
13	109	Depth Reduction for Circuits with a Single Layer of Modular Counting Gates	claim
14	108	Compressed Word Problems in HNN-Extensions and Amalgamated Products	claim
15	107	A Feebly Secure Trapdoor Function	claim
16	107	The Reachability Problem over Infinite Graphs	claim
17	105	Structural Complexity of AvgBPP	claim
18	98	Formal Verification of Gate-Level Computer Systems	claim
19	96	Lower Bounds for the Determinantal Complexity of Explicit Low Degree Polynomials	claim
20	90	Canonical Calculi: Invertibility, Axiom Expansion and (Non)-determinism	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers