1199 search results - page 40 / 240 » Parameterized Proof Complexity |
123
click to vote
MST
2006
15 years 2 months ago
2006
A central question in computational biology is the design of genetic markers to distinguish between two given sets of (DNA) sequences. This question is formalized as the NP-comple...
127
click to vote
PKC
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. Zero-knowledge proofs with witness elimination are protocols that enable a prover to demonstrate knowledge of a witness to the verifier that accepts the interaction prov...
104
click to vote
TAMC
2010
Springer
15 years 7 months ago
2010
Springer
Unless we resolve the P vs NP question, we are unable to say whether there is an algorithm (acceptor) that accepts Boolean tautologies in polynomial time and does not accept non-ta...
119
click to vote
TROB
2010
14 years 9 months ago
2010
Abstract--This paper proposes a unified optimization framework to solve the time parameterization problem of humanoid robot paths. Even though the time parameterization problem is ...
119
click to vote
IVA
2010
Springer
15 years 27 days ago
2010
Springer
Abstract. While interactive virtual humans are becoming widely used in education, training and therapeutic applications, building animations which are both realistic and parameteri...