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

103views Theoretical Computer Science» more MFCS 2010»

Solving minones-2-sat as Fast as vertex cover

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

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers