Search Sciweavers | Sciweavers

504 search results - page 6 / 101

» The Complexity of Symmetry-Breaking Formulas

106

click to vote

LOGCOM
2010

96views more LOGCOM 2010»

The Complexity of the Warranted Formula Problem in Propositional Argumentation

15 years 2 months ago

Download www.cs.ucl.ac.uk

The notion of warrant or justiﬁcation is one of the central concepts in formal models of argumentation. The dialectical deﬁnition of warrant is expressed in terms of recursive...

Robin Hirsch, Nikos Gorogiannis

claim paper

Read More »

Voted

STOC
1998
ACM

115views Algorithms» more STOC 1998»

On the Complexity of Unsatisfiability Proofs for Random k-CNF Formulas

15 years 8 months ago

Download www.cs.helsinki.fi

Paul Beame, Richard M. Karp, Toniann Pitassi, Mich...

claim paper

Read More »

Voted

CSL
1987
Springer

79views Automated Reasoning» more CSL 1987»

Complexity Cores and Hard-To-Prove Formulas

15 years 7 months ago

Download www.uni-ulm.de

Uwe Schöning

claim paper

Read More »

Voted

IANDC
2008

81views more IANDC 2008»

Complexity of DNF minimization and isomorphism testing for monotone formulas

15 years 4 months ago

Download www.uni-weimar.de

Judy Goldsmith, Matthias Hagen, Martin Mundhenk

claim paper

Read More »

127

click to vote

JCSS
2011

75views more JCSS 2011»

The complexity of Boolean formula minimization

14 years 11 months ago

Sciweavers

Explore & Download

Productivity Tools

Sciweavers