受强制性开放获取政策约束的文章 - Victor Lagerkvist了解详情
可在其他位置公开访问的文章：18 篇
Strong partial clones and the time complexity of SAT problems
P Jonsson, V Lagerkvist, G Nordh, B Zanuttini
Journal of Computer and System Sciences 84, 52-78, 2017
强制性开放获取政策： German Research Foundation, Swedish Research Council
Complexity of SAT problems, clone theory and the exponential time hypothesis
P Jonsson, V Lagerkvist, G Nordh, B Zanuttini
Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete …, 2013
强制性开放获取政策： Swedish Research Council
An initial study of time complexity in infinite-domain constraint satisfaction
P Jonsson, V Lagerkvist
Artificial Intelligence 245, 115-133, 2017
强制性开放获取政策： German Research Foundation, Swedish Research Council
Kernelization of constraint satisfaction problems: A study through universal algebra
V Lagerkvist, M Wahlström
International Conference on Principles and Practice of Constraint …, 2017
强制性开放获取政策： German Research Foundation
Why are CSPs based on partition schemes computationally hard?
P Jonsson, V Lagerkvist
43rd International Symposium on Mathematical Foundations of Computer Science …, 2018
强制性开放获取政策： German Research Foundation, Swedish Research Council, European Commission
A dichotomy theorem for the inverse satisfiability problem
V Lagerkvist, B Roy
37th IARCS Annual Conference on Foundations of Software Technology and …, 2018
强制性开放获取政策： German Research Foundation
A preliminary investigation of satisfiability problems not harder than 1-in-3-SAT
V Lagerkvist, B Roy
41st International Symposium on Mathematical Foundations of Computer Science …, 2016
强制性开放获取政策： German Research Foundation
Acyclic orders, partition schemes and CSPs: Unified hardness proofs and improved algorithms
P Jonsson, V Lagerkvist, G Osipov
Artificial Intelligence 296, 103505, 2021
强制性开放获取政策： Knut and Alice Wallenberg Foundation, Swedish Research Council
Complexity of inverse constraint problems and a dichotomy for the inverse satisfiability problem
V Lagerkvist, B Roy
Journal of Computer and System Sciences 117, 23-39, 2021
强制性开放获取政策： German Research Foundation, Swedish Research Council
Fine-grained time complexity of constraint satisfaction problems
P Jonsson, V Lagerkvist, B Roy
ACM Transactions on Computation Theory (TOCT) 13 (1), 1-32, 2021
强制性开放获取政策： German Research Foundation, Swedish Research Council, European Commission
Constructing np-intermediate problems by blowing holes with parameters of various properties
P Jonsson, V Lagerkvist, G Nordh
Theoretical Computer Science 581, 67-82, 2015
强制性开放获取政策： Swedish Research Council
On the interval of Boolean strong partial clones containing only projections as total operations
M Couceiro, L Haddad, V Lagerqvist, B Roy
2017 IEEE 47th International Symposium on Multiple-Valued Logic (ISMVL), 88-93, 2017
强制性开放获取政策： German Research Foundation
A survey on the fine-grained complexity of constraint satisfaction problems based on partial polymorphisms
M Couceiro, L Haddad, V Lagerkvist
Journal of Multiple-Valued Logic and Soft Computing 38 (1-2), 115-136, 2022
强制性开放获取政策： Swedish Research Council
Improved Algorithms for Allen's Interval Algebra: a Dynamic Programming Approach.
L Eriksson, V Lagerkvist
IJCAI, 1873-1879, 2021
强制性开放获取政策： Swedish Research Council
Lower bounds and faster algorithms for equality constraints
P Jonsson, V Lagerkvist
Proceedings of the Twenty-Ninth International Conference on International …, 2021
强制性开放获取政策： Swedish Research Council
The exponential-time hypothesis and the relative complexity of optimization and logical reasoning problems
P Jonsson, V Lagerkvist, J Schmidt, H Uppman
Theoretical Computer Science 892, 1-24, 2021
强制性开放获取政策： Swedish Research Council
General Lower Bounds and Improved Algorithms for Infinite–Domain CSPs
P Jonsson, V Lagerkvist
Algorithmica 85 (1), 188-215, 2023
强制性开放获取政策： Swedish Research Council
Reasoning short cuts in infinite domain constraint satisfaction: Algorithms and lower bounds for backdoors
P Jonsson, V Lagerkvist, S Ordyniak
Leibniz International Proceedings in Informatics, LIPIcs 210, 2021
强制性开放获取政策： Swedish Research Council, UK Engineering and Physical Sciences Research Council
出版信息和资助信息由计算机程序自动确定