MFCS 2010 - PDF Preprint Papers

MFCS 2010 International Symposium on Mathematical Foundations of Computer

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed MFCS-2010 Paper

click to vote

MFCS
2010
Springer

249views Theoretical Computer Science» more MFCS 2010»

Solving minones-2-sat as Fast as vertex cover

13 years 11 months ago

Download www.imsc.res.in

The problem of ﬁnding a satisfying assignment for a 2-SAT formula that minimizes the number of variables that are set to 1 (min ones 2–sat) is NP-complete. It generalizes the w...

Neeldhara Misra, N. S. Narayanaswamy, Venkatesh Ra...

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	249	Solving minones-2-sat as Fast as vertex cover	claim
2	181	Breaking the Rectangle Bound Barrier against Formula Size Lower Bounds	claim
3	177	Properties of Visibly Pushdown Transducers	claim
4	176	Asynchronous Omega-Regular Games with Partial Information	claim
5	172	Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems	claim
6	169	A dexptime-Complete Dolev-Yao Theory with Distributive Encryption	claim
7	162	Semi-linear Parikh Images of Regular Expressions via Reduction	claim
8	159	Robust Computations with Dynamical Systems	claim
9	155	Harnessing MLF with the Power of System F	claim
10	154	Evaluating Non-square Sparse Bilinear Forms on Multiple Vector Pairs in the I/O-Model	claim
11	152	Revisiting Ackermann-Hardness for Lossy Counter Machines and Reset Petri Nets	claim
12	149	Parity Games with Partial Information Played on Graphs of Bounded Complexity	claim
13	145	Persistent Homology under Non-uniform Error	claim
14	145	Weights of Exact Threshold Functions	claim
15	140	Information Complexity of Online Problems	claim
16	139	The Multivariate Resultant Is NP-hard in Any Characteristic	claim
17	129	On the Topological Complexity of MSO+U and Related Automata Models	claim
18	127	Meta-Envy-Free Cake-Cutting Protocols	claim
19	127	Qualitative Analysis of Partially-Observable Markov Decision Processes	claim
20	125	Scheduling Real-Time Mixed-Criticality Jobs	claim
21	123	Resource Combinatory Algebras	claim
22	121	On Problem Kernels for Possible Winner Determination under the k-Approval Protocol	claim
23	111	Proof Systems and Transformation Games	claim
24	105	Least and Greatest Solutions of Equations over Sets of Integers	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers