Computing and Combinatorics
From MaRDI portal
Publication:5716924
DOI10.1007/11533719zbMath1128.68359OpenAlexW4376561447MaRDI QIDQ5716924
Publication date: 11 January 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11533719
Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items
Some observations on holographic algorithms, Valiant's holant theorem and matchgate tensors, The complexity of computational problems about Nash equilibria in symmetric win-lose games, Barnette's conjecture through the lens of the \(Mod_k P\) complexity classes, Algorithms for modular counting of roots of multivariate polynomials, Unnamed Item, Unnamed Item
