Sciweavers

1169 search results - page 27 / 234
» Degrees of monotone complexity
Sort
View
JC
2006
105views more  JC 2006»
13 years 8 months ago
On the complexity of the resolvent representation of some prime differential ideals
We prove upper bounds on the order and degree of the polynomials involved in a resolvent representation of the prime differential ideal associated with a polynomial differential s...
Lisi D'Alfonso, Gabriela Jeronimo, Pablo Solern&oa...
IANDC
1998
64views more  IANDC 1998»
13 years 8 months ago
Positive Versions of Polynomial Time
We show that restricting a number of characterizations of the complexity class P to be positive (in natural ways) results in the same class of (monotone) problems which we denote ...
Clemens Lautemann, Thomas Schwentick, Iain A. Stew...
ECSQARU
2005
Springer
14 years 2 months ago
A Possibilistic Inconsistency Handling in Answer Set Programming
Abstract. Both in classical logic and in Answer Set Programming, inconsistency is characterized by non existence of a model. Whereas every formula is a theorem for inconsistent set...
Pascal Nicolas, Laurent Garcia, Igor Stépha...
ICDCS
2002
IEEE
14 years 1 months ago
An Optimal Strategy for Anonymous Communication Protocols
For many Internet applications, the ability to protect the identity of participants in a distributed applications is critical. For such applications, a number of anonymous communi...
Yong Guan, Xinwen Fu, Riccardo Bettati, Wei Zhao
ACL
2006
13 years 10 months ago
Mildly Non-Projective Dependency Structures
We present parsing algorithms for various mildly non-projective dependency formalisms. In particular, algorithms are presented for: all well-nested structures of gap degree at mos...
Marco Kuhlmann, Joakim Nivre