Sciweavers

504 search results - page 25 / 101
» The Complexity of Symmetry-Breaking Formulas
Sort
View
AAAI
1994
13 years 11 months ago
Incremental Recompilation of Knowledge
d Abstract) Goran Gogic l, Christos H. Papadimitriou', and Martha Sideri2 : Approximating a general formula from above and below by Horn formulas (its Horn envelope and Horn c...
Goran Gogic, Christos H. Papadimitriou, Martha Sid...
JC
2007
96views more  JC 2007»
13 years 9 months ago
Error linear complexity measures for multisequences
Complexity measures for sequences over finite fields, such as the linear complexity and the k-error linear complexity, play an important role in cryptology. Recent developments ...
Wilfried Meidl, Harald Niederreiter, Ayineedi Venk...
ITA
2007
13 years 9 months ago
Three notes on the complexity of model checking fixpoint logic with chop
Abstract. This paper analyses the complexity of model checking Fixpoint Logic with Chop – an extension of the modal µ-calculus with a sequential composition operator. It uses tw...
Martin Lange
ICIP
1998
IEEE
14 years 11 months ago
Complex Representations of Algebraic Curves
In this work, we employ a complex representation for an algebraic curve, and illustrate how the algebraic transformation which relates two Euclidean equivalent curves can be deter...
Mustafa Unel, William A. Wolovich
JC
2008
92views more  JC 2008»
13 years 9 months ago
Characterizing Valiant's algebraic complexity classes
Valiant introduced 20 years ago an algebraic complexity theory to study the complexity of polynomial families. The basic computation model used is the arithmetic circuit, which ma...
Guillaume Malod, Natacha Portier