Sciweavers

504 search results - page 6 / 101
» The Complexity of Symmetry-Breaking Formulas
Sort
View
LOGCOM
2010
96views more  LOGCOM 2010»
13 years 8 months ago
The Complexity of the Warranted Formula Problem in Propositional Argumentation
The notion of warrant or justification is one of the central concepts in formal models of argumentation. The dialectical definition of warrant is expressed in terms of recursive...
Robin Hirsch, Nikos Gorogiannis
STOC
1998
ACM
115views Algorithms» more  STOC 1998»
14 years 2 months ago
On the Complexity of Unsatisfiability Proofs for Random k-CNF Formulas
Paul Beame, Richard M. Karp, Toniann Pitassi, Mich...
IANDC
2008
81views more  IANDC 2008»
13 years 9 months ago
Complexity of DNF minimization and isomorphism testing for monotone formulas
Judy Goldsmith, Matthias Hagen, Martin Mundhenk
JCSS
2011
75views more  JCSS 2011»
13 years 4 months ago
The complexity of Boolean formula minimization
David Buchfuhrer, Christopher Umans