Seguir
Jakob Nordström
Título
Citado por
Citado por
Año
Divide and Conquer: Towards Faster Pseudo-Boolean Solving.
J Elffers, J Nordström
27th International Joint Conference on Artificial Intelligence (IJCAI '18 …, 2018
992018
Pebble games, proof complexity and time-space trade-offs
J Nordström
Logical Methods in Computer Science 9 (3), 2013
922013
On the virtue of succinct proofs: Amplifying communication complexity hardness to time-space trade-offs in proof complexity
T Huynh, J Nordström
Proceedings of the 44th Annual ACM Symposium on Theory of Computing (STOC …, 2012
912012
Proof complexity and SAT solving
S Buss, J Nordström
Handbook of Satisfiability, 2nd edition, 233-350, 2021
872021
Short proofs may be spacious: An optimal separation of space and length in resolution
E Ben-Sasson, J Nordstrom
Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer …, 2008
832008
Understanding Space in Proof Complexity: Separations and Trade-offs via Substitutions.
E Ben-Sasson, J Nordström
Proceedings of the 2nd Symposium on Innovations in Computer Science (ICS '11 …, 2011
822011
Narrow proofs may be spacious: Separating space and width in resolution
J Nordström
Proceedings of the thirty-eighth annual ACM symposium on theory of computing …, 2006
792006
How limited interaction hinders real communication (and what it means for proof and circuit complexity)
F de Rezende, Susanna, J Nordström, M Vinyals
Proceedings of the 57th Annual IEEE Symposium on Foundations of Computer …, 2016
67*2016
On the interplay between proof complexity and SAT solving
J Nordström
ACM SIGLOG News 2 (3), 19-44, 2015
652015
Narrow proofs may be maximally long
A Atserias, M Lauria, J Nordström
ACM Transactions on Computational Logic 17 (3), 19:1-19:30, 2016
622016
Space Complexity in Polynomial Calculus
Y Filmus, M Lauria, J Nordström, N Ron-Zewi, N Thapen
SIAM Journal on Computing 44 (4), 1119-1153, 2015
622015
Some trade-off results for polynomial calculus
C Beck, J Nordström, B Tang
Proceedings of the 45th Annual ACM Symposium on Theory of Computing (STOC …, 2013
602013
CNFgen: A generator of crafted benchmarks
M Lauria, J Elffers, J Nordström, M Vinyals
Theory and Applications of Satisfiability Testing–SAT 2017: 20th …, 2017
582017
New wine into old wineskins: A survey of some pebbling classics with supplemental results
J Nordström
Manuscript in preparation. Current draft version available at the webpage …, 2020
54*2020
Certified Dominance and Symmetry Breaking for Combinatorial Optimisation
B Bogaerts, S Gocht, C McCreesh, J Nordström
Journal of Artificial Intelligence Research 77, 1539–1589-1539–1589, 2023
52*2023
Towards an optimal separation of space and length in resolution
J Nordström, J Håstad
Proceedings of the fortieth annual ACM symposium on Theory of computing, 701-710, 2008
512008
Relating proof complexity measures and practical hardness of SAT
M Järvisalo, A Matsliah, J Nordström, S Živný
Proceedings of the 18th International Conference on Principles and Practice …, 2012
492012
Certifying Parity Reasoning Efficiently Using Pseudo-Boolean Proofs
S Gocht, J Nordström
Proceedings of the 35th AAAI Conference on Artificial Intelligence (AAAI '21 …, 2021
462021
A generalized method for proving polynomial calculus degree lower bounds
M Mikša, J Nordström
Proceedings of the 30th Annual Computational Complexity Conference (CCC '15 …, 2015
46*2015
Justifying All Differences Using Pseudo-Boolean Reasoning
J Elffers, S Gocht, C McCreesh, J Nordström
Proceedings of the 34th AAAI Conference on Artificial Intelligence (AAAI '20 …, 2020
432020
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20