1383 search results - page 109 / 277 » On the Complexity of the Interlace Polynomial |
186
click to vote
ICAI
2009
15 years 4 months ago
2009
Quantified Boolean formulas are a powerful representation that have been used to capture and solve a variety of problems in Artificial Intelligence. While most research has focused...
154
click to vote
ISSAC
2007
Springer
16 years 1 months ago
2007
Springer
In this paper, it is shown that the Hilbert series of a Borel type ideal may be computed within a complexity which is polynomial in Dn where n + 1 is the number of unknowns and D ...
137
click to vote
JCSS
2006
15 years 7 months ago
2006
Resolving an issue open since Fenner, Fortnow, and Kurtz raised it in [FFK94], we prove that LWPP is not uniformly gap-definable and that WPP is not uniformly gap-definable. We do...
194
click to vote
ASIACRYPT
2001
Springer
15 years 11 months ago
2001
Springer
The number of communication rounds is a classic complexity measure for protocols; reducing round complexity is a major goal in protocol design. However, when the communication time...
226
Voted
COCO
2009
Springer
16 years 1 months ago
2009
Springer
A major open question in communication complexity is if randomized and quantum communication are polynomially related for all total functions. So far, no gap larger than a power o...