Abstract
We develop and analyze P-optimal approximation algorithms for various generalized satisfiability problems and determine the corresponding P-optimal thresholds. The most novel aspect of the paper is that we develop new P-optimal algorithms for restricted generalized satisfiability problems which are defined by forbidden subformulas. All our algorithms run in linear time on a RAM.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
