2018 search results - page 10 / 404 » Code Normal Forms |
AUTOMATICA
2004
14 years 11 months ago
2004
In this paper, the problem of non-regular static state feedback linearization of a ne nonlinear systems is considered. First of all, a new canonical form for non-regular feedback ...
123
click to vote
TCS
2011
14 years 6 months ago
2011
Abstract. We present the first fully dynamic algorithm for computing the characteristic polynomial of a matrix. In the generic symmetric case our algorithm supports rank-one updat...
AAAI
2010
14 years 9 months ago
2010
We consider in this paper the size of a Decomposable Negation Normal Form (DNNF) that respects a given vtree (known as structured DNNF). This representation of propositional knowl...
IPL
2007
14 years 11 months ago
2007
We consider the problem Monet—given two monotone formulas ϕ in DNF and ψ in CNF, decide whether they are equivalent. While Monet is probably not coNPhard, it is a long standin...
95
Voted
VLSID
2007
IEEE
16 years 3 days ago
2007
IEEE
Boolean Satisfiability is seeing increasing use as a decision procedure in Electronic Design Automation (EDA) and other domains. Most applications encode their domain specific cons...