Algorithms and Computation
From MaRDI portal
Publication:5897897
DOI10.1007/11602613zbMATH Open1175.68208OpenAlexW2304246803MaRDI QIDQ5897897FDOQ5897897
Authors: Masaki Yamamoto
Publication date: 14 November 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11602613
Recommendations
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Analysis of algorithms and problem complexity (68Q25)
Cited In (12)
- An improved exact algorithm for the domatic number problem
- A fast algorithm for SAT in terms of formula length
- Title not available (Why is that?)
- Clause Shortening Combined with Pruning Yields a New Upper Bound for Deterministic SAT Algorithms
- An improved deterministic \#SAT algorithm for small De Morgan formulas
- New and improved algorithms for unordered tree inclusion
- Determining a singleton attractor of an AND/OR Boolean network in \(O(n^{1.587})\) time
- An improved deterministic \#SAT algorithm for small De Morgan formulas
- An Improved Algorithm for Detecting a Singleton Attractor in a Boolean Network Consisting of AND/OR Nodes
- An improved upper bound for SAT
- An improved deterministic local search algorithm for 3-SAT
- Further improvements for SAT in terms of formula length
This page was built for publication: Algorithms and Computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5897897)