504 search results - page 4 / 101 » The Complexity of Symmetry-Breaking Formulas |
MFCS
2005
Springer
14 years 3 months ago
2005
Springer
We investigate the complexity of finding prime implicants and minimal equivalent DNFs for Boolean formulas, and of testing equivalence and isomorphism of monotone formulas. For DN...
CC
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. We prove lower bounds on the randomized two-party communication complexity of functions that arise from read-once boolean formulae. A read-once boolean formula is a formu...
SPAA
2009
ACM
14 years 4 months ago
2009
ACM
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...
STACS
2010
Springer
14 years 4 months ago
2010
Springer
We call a CNF formula linear if any two clauses have at most one variable in common. We show that there exist unsatisfiable linear k-CNF formulas with at most 4k2 4k clauses, and ...
JSAT
2007
13 years 9 months ago
2007
This paper is concerned with the complexity of some natural subclasses of minimal unsatisfiable formulas. We show the DP –completeness of the classes of maximal and marginal mi...