1383 search results - page 76 / 277 » On the Complexity of the Interlace Polynomial |
153
click to vote
TCS
1998
15 years 6 months ago
1998
The complexity of the reachability problem for live and safe free-choice Petri nets has been open for several years. Several partial results seemed to indicate that the problem is...
179
click to vote
STACS
2000
Springer
15 years 9 months ago
2000
Springer
Abstract. We compare classical and quantum query complexities of total Boolean functions. It is known that for worst-case complexity, the gap between quantum and classical can be a...
166
click to vote
FOCS
2003
IEEE
15 years 11 months ago
2003
IEEE
We give a complexity theoretic classification of homomorphism problems for graphs and, more generally, relational structures obtained by restricting the left hand side structure ...
171
click to vote
WICON
2008
15 years 7 months ago
2008
It is well known that the maximum weighted independent set (MWIS) problem is NP-complete. Moreover, optimal scheduling in wireless networks requires solving a MWIS problem. Conseq...
162
click to vote
AML
2006
15 years 6 months ago
2006
The paper considers a commonly used axiomatization of the classical propositional logic and studies how different axiom schemata in this system contribute to proof complexity of th...