Sciweavers

1199 search results - page 32 / 240
» Parameterized Proof Complexity
Sort
View
KI
2010
Springer
13 years 3 months ago
Differential Dynamic Logics
Hybrid systems are models for complex physical systems and are defined as dynamical systems with interacting discrete transitions and continuous evolutions along differential equa...
André Platzer
DICTA
2003
13 years 10 months ago
The Parameterization of Joint Rotation with the Unit Quaternion
Abstract. Unit quaternion is an ideal parameterization for joint rotations. However, due to the complexity of the geometry of S3 group, it’s hard to specify meaningful joint cons...
Qiang Liu, Edmond C. Prakash
STOC
2002
ACM
101views Algorithms» more  STOC 2002»
14 years 9 months ago
An exponential separation between regular and general resolution
: This paper gives two distinct proofs of an exponential separation between regular resolution and unrestricted resolution. The previous best known separation between these systems...
Michael Alekhnovich, Jan Johannsen, Toniann Pitass...
CIE
2008
Springer
13 years 10 months ago
Succinct NP Proofs from an Extractability Assumption
Abstract We prove, using a non-standard complexity assumption, that any language in NP has a 1-round (that is, the verifier sends a message to the prover, and the prover sends a me...
Giovanni Di Crescenzo, Helger Lipmaa
IPL
2008
65views more  IPL 2008»
13 years 8 months ago
On the fixed-parameter tractability of parameterized model-checking problems
In this note, we show, through the use of examples, how generic results for proving fixed-parameter tractability which apply to restricted classes of structures can sometimes be m...
Iain A. Stewart