504 search results - page 12 / 101 » The Complexity of Symmetry-Breaking Formulas |
106
click to vote
SAT
2009
Springer
15 years 10 months ago
2009
Springer
In this paper we consider the class of boolean formulas in Conjunctive Normal Form (CNF) where for each variable all but at most d occurrences are either positive or negative. This...
133
click to vote
TAMC
2010
Springer
15 years 9 months ago
2010
Springer
We study possible formulations of algebraic propositional proof systems operating with noncommutative formulas. We observe that a simple formulation gives rise to systems at least ...
171
click to vote
CORR
2011
Springer
14 years 7 months ago
2011
Springer
This paper presents an efficient method to compute the maximum likelihood (ML) estimation of the parameters of a complex 2-D sinusoidal, with the complexity order of the FFT. The...
139
click to vote
ICALP
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We study – within the framework of propositional proof complexity – the problem of certifying unsatisfiability of CNF formulas under the promise that any satisfiabl...
124
click to vote
TSP
2010
14 years 10 months ago
2010
We derive the entropy rate formula for a complex Gaussian random process by using a widely linear model. The resulting expression is general and applicable to both circular and non...