1274 search results - page 127 / 255 » New Proofs for |
145
click to vote
FORMATS
2004
Springer
15 years 9 months ago
2004
Springer
This paper presents assume-guarantee style substitutivity results for the recently published timed I/O automaton modeling framework. These results are useful for decomposing verifi...
137
Voted
ISSAC
2009
Springer
16 years 11 days ago
2009
Springer
We show that detecting real roots for honestly n-variate (n + 2)-nomials (with integer exponents and coefficients) can be done in time polynomial in the sparse encoding for any ï¬...
158
click to vote
ATVA
2006
Springer
15 years 9 months ago
2006
Springer
Ping-pong protocols with recursive definitions of agents, but without any active intruder, are a Turing powerful model. We show that under the environment sensitive semantics (i.e....
161
click to vote
CATS
2006
15 years 7 months ago
2006
A complete description and proof of correctness are given for a new polynomial time algorithm for a class of codes based on directed graphs and involving construction well known i...
144
click to vote
MMSEC
2006
ACM
15 years 11 months ago
2006
ACM
Current zero-knowledge watermark detectors are based on a linear correlation between the asset features and a given secret sequence. This detection function is susceptible of bein...