224 search results - page 5 / 45 » A parallel repetition theorem |
FOCS
2008
IEEE
14 years 2 months ago
2008
IEEE
ECCC
2010
13 years 7 months ago
2010
COMBINATORICS
2002
13 years 7 months ago
2002
A sequence u = u1u2...un is said to be nonrepetitive if no two adjacent blocks of u are exactly the same. For instance, the sequence abcbcba contains a repetition bcbc, while abca...
FOCS
2008
IEEE
14 years 2 months ago
2008
IEEE
We consider one-round games between a classical verifier and two provers who share entanglement. We show that when the constraints enforced by the verifier are ‘unique’ cons...
HOTI
2008
IEEE
14 years 2 months ago
2008
IEEE
— Recent network intrusion detection systems (NIDS) use regular expressions to represent suspicious or malicious character sequences in packet payloads in a more efficient way. ...