The following pages link to Peter Jonsson (Q269510):
Displayed 50 items.
- Constraint satisfaction and semilinear expansions of addition over the rationals and the reals (Q269512) (← links)
- A nonapproximability result for finite function generation (Q287157) (← links)
- Near-optimal nonapproximability results for some \textsc{Npo} PB-complete problems (Q293458) (← links)
- Strong partial clones and the time complexity of SAT problems (Q340559) (← links)
- Computational complexity of linear constraints over the integers (Q360099) (← links)
- Limitations of acyclic causal graphs for planning (Q490647) (← links)
- Refining complexity analyses in planning by exploiting the exponential time hypothesis (Q504223) (← links)
- An initial study of time complexity in infinite-domain constraint satisfaction (Q514144) (← links)
- Algorithms for four variants of the exact satisfiability problem (Q596105) (← links)
- Approximating integer programs with positive right-hand sides (Q656570) (← links)
- Tractability conditions for numeric CSPs (Q683751) (← links)
- Recognizing frozen variables in constraint satisfaction problems (Q706617) (← links)
- The complexity of counting homomorphisms seen from the other side (Q706636) (← links)
- Point algebras for temporal reasoning: Algorithms and complexity (Q814509) (← links)
- Complexity classification in qualitative temporal constraint reasoning (Q814637) (← links)
- Hard constraint satisfaction problems have hard gaps at location 1 (Q837178) (← links)
- Maximum \(H\)-colourable subdigraphs and constraint optimization with arbitrary weights (Q881590) (← links)
- Computational complexity of auditing finite attributes in statistical databases (Q931731) (← links)
- Approximability of clausal constraints (Q970111) (← links)
- State-variable planning under structural restrictions: algorithms and complexity (Q1128767) (← links)
- Tractable plan existence does not imply tractable plan generation (Q1267773) (← links)
- A unifying approach to temporal constraint reasoning (Q1274294) (← links)
- A complete classification of tractability in Allen's algebra relative to subsets of basic relations (Q1277697) (← links)
- Computational complexity of relating time points with intervals (Q1292318) (← links)
- Twenty-one large tractable subclasses of Allen's algebra (Q1402726) (← links)
- Boolean constraint satisfaction: Complexity results for optimization problems with arbitrary weights (Q1575713) (← links)
- Disjunctions, independence, refinements (Q1614865) (← links)
- Circuit satisfiability and constraint satisfaction around Skolem arithmetic (Q1676359) (← links)
- Constants and finite unary relations in qualitative constraint reasoning (Q1749385) (← links)
- Counting models for 2SAT and 3SAT formulae (Q1770390) (← links)
- Strong bounds on the approximability of two Pspace-hard problems in propositional planning (Q1978020) (← links)
- Towards efficient universal planning: A randomized approach (Q1978311) (← links)
- A framework for analysing state-abstraction methods (Q2060741) (← links)
- Acyclic orders, partition schemes and CSPs: unified hardness proofs and improved algorithms (Q2238592) (← links)
- Constructing NP-intermediate problems by blowing holes with parameters of various properties (Q2345449) (← links)
- A complete parameterized complexity analysis of bounded planning (Q2353405) (← links)
- General lower bounds and improved algorithms for infinite-domain CSPs (Q2700386) (← links)
- Properties of an Approximability-related Parameter on Circular Complete Graphs (Q2840526) (← links)
- A Refined View of Causal Graphs and Component Sizes: SP-Closed Graph Classes and Beyond (Q2842195) (← links)
- Horn versus full first-order: Complexity dichotomies in algebraic constraint satisfaction (Q2893326) (← links)
- Algorithms and Limits for Compact Plan Representations (Q2905381) (← links)
- Automaton Plans (Q2922398) (← links)
- Affine Consistency and the Complexity of Semilinear Constraints (Q2922628) (← links)
- Building tractable disjunctive constraints (Q2946994) (← links)
- A Model-Theoretic View on Qualitative Constraint Reasoning (Q2974510) (← links)
- THE REDUCTS OF THE HOMOGENEOUS BINARY BRANCHING <i>C</i>-RELATION (Q2976332) (← links)
- Retractions to Pseudoforests (Q3084215) (← links)
- Essential Convexity and Complexity of Semi-Algebraic Constraints (Q3166226) (← links)
- Min CSP on Four Elements: Moving beyond Submodularity (Q3169450) (← links)
- Circuit Satisfiability and Constraint Satisfaction Around Skolem Arithmetic (Q3188272) (← links)