Search Results for author:
Found 4 papers, 0 papers with code
Solving Quantified Boolean Formulas with Few Existential Variables
The quantified Boolean formula (QBF) problem is an important decision problem generally viewed as the archetype for PSPACE-completeness.
Improved Algorithms for Allen's Interval Algebra by Dynamic Programming with Sublinear Partitioning
Using this technique we obtain a major improvement of $O^*((\frac{cn}{\log{n}})^{n})$ for Allen's interval algebra.
A Fast Algorithm for Consistency Checking Partially Ordered Time
Partially ordered models of time occur naturally in applications where agents or processes cannot perfectly communicate with each other, and can be traced back to the seminal work of Lamport.
A Multivariate Complexity Analysis of Qualitative Reasoning Problems
Qualitative reasoning is an important subfield of artificial intelligence where one describes relationships with qualitative, rather than numerical, relations.
