Filters








5 Hits in 4.4 sec

Fine-grained dichotomies for the Tutte plane and Boolean #CSP [article]

Cornelius Brand, Holger Dell, Marc Roth
2016 arXiv   pre-print
Jaeger, Vertigan, and Welsh [15] proved a dichotomy for the complexity of evaluating the Tutte polynomial at fixed points: The evaluation is #P-hard almost everywhere, and the remaining points admit polynomial-time  ...  Another dichotomy theorem we strengthen is the one of Creignou and Hermann [6] for counting the number of satisfying assignments to a constraint satisfaction problem instance over the Boolean domain.  ...  other participants of the "dichotomies" work group at the Simons Institute in the spring of 2016.  ... 
arXiv:1606.06581v1 fatcat:ut6354ay3beuva7mnmg77352bu

Fine-Grained Dichotomies for the Tutte Plane and Boolean #CSP

Cornelius Brand, Holger Dell, Marc Roth
2018 Algorithmica  
Fine-Grained Dichotomies for the Tutte Plane and Boolean #CSP polynomial-time algorithm that is given access to an oracle for counting perfect matchings.  ...  Jaeger, Vertigan, and Welsh [15] proved a dichotomy for the complexity of evaluating the Tutte polynomial at fixed points: The evaluation is #P-hard almost everywhere, and the remaining points admit polynomial-time  ...  dichotomies" work group at the Simons Institute in the spring of 2016.  ... 
doi:10.1007/s00453-018-0472-z fatcat:i2ys5fwwkngxbmy557eybmtbti

Foreword: Special Issue on Parameterized and Exact Computation

Jiong Guo, Danny Hermelin
2018 Algorithmica  
In "Fine-grained Dichotomies for the Tutte Plane and Boolean #CSP," Cornelius Brand, Holger Dell, and Marc Roth complete the dichotomies for the compleixty of evaluting the Tutte polynomial at fixed points  ...  and for counting the number of satisfying assignments to a constraint satisfication instance over the Boolean domain.  ... 
doi:10.1007/s00453-018-0529-z fatcat:4onov7utznfdrfctt2auif6c2m

Reinforcement Learning (Dagstuhl Seminar 13321) The Critical Internet Infrastructure (Dagstuhl Seminar 13322) Coding Theory (Dagstuhl Seminar 13351) Interaction with Information for Visual Reasoning (Dagstuhl Seminar 13352)

Peter Auer, Marcus Hutter, Laurent, Georg Carle, Jochen Schiller, Steve Uhlig, Walter Willinger, Matthias Wählisch, Thore Husfeldt, Ramamohan Paturi, Gregory Sorkin, Ryan Williams (+14 others)
unpublished
Biological OFF rate can be studied, OFF rate is the time for A and B to stay attached. Then, they dissociate. Should attach long enough and go to the membrane for reaction.  ...  Acknowledgments The editors of this report would like to thank all participants for very fruitful and open-minded discussions! In particular, we thank the operators for sharing practical insights.  ...  We study the complexity of the satisfiability problem for quantified Boolean formulas.  ... 
fatcat:iz3co5xisfejfbnx2t6ptrorfm

2013 Jahresbericht Annual Report

Gesellschafter
unpublished
Weights are not traditionally considered in CSP, but with this addition, many applications can be viewed in terms of counting CSPs.  ...  We will address the vulnerability of the Internet from a number of different angles (e.g., physical infrastructure, control plane, data plane, services, etc.), with an emphasis on the core transport infrastructure  ...  ' Meeting convene meetings of the Supervisory Board and are responsible Gesellschaftsvertrag und die Aufnahme weiterer Gesell-for amendments to the articles of incorporation and the schafter, siehe Fig  ... 
fatcat:xixyfnmw65ehzlozcfxl55r5uq