HomeEPiC SeriesKalpa PublicationsPreprintsFor AuthorsFor Editors

Keyword:computational complexity

Papers
PH = PSPACE
Valerii Sopin
EasyChair Preprint no. 7481
A New Algorithm for Solving the rSUM Problem
Valerii Sopin
EasyChair Preprint no. 8271
Are Quantum Speedups for Learning Expressive Classes Possible?
Srinivasan Arunachalam, Alex B. Grilo, Tom Gur, Igor C. Oliveira and Aarthi Sundaram
EasyChair Preprint no. 7564
Image Segmentation Morphology
Arun Kumar and Pankaj Kumar Saini
EasyChair Preprint no. 4337
On Disallowing Punctual Intervals in Reflexive Semantics of Halpern-Shoham Logic
Przemysław Andrzej Wałęga
In:LPAR-22 Workshop and Short Paper Proceedings
Quantified Boolean Formulas: Call the Plumber!
Josef Lindsberger, Alexander Maringele and Georg Moser
In:LPAR-21. 21st International Conference on Logic for Programming, Artificial Intelligence and Reasoning
An Algebra of Combined Constraint Solving
Eugenia Ternovska
In:GCAI 2015. Global Conference on Artificial Intelligence
Dynamics of Argumentation Systems: A Basic Theory
Beishui Liao, Li Jin and Robert Koons
In:LPAR-17-short. short papers for 17th International Conference on Logic for Programming, Artificial intelligence, and Reasoning.
Complexity of Admissible Rules in the Implication-Negation Fragment of Intuitionistic Logic
Petr Cintula and George Metcalfe
In:LPAR-17-short. short papers for 17th International Conference on Logic for Programming, Artificial intelligence, and Reasoning.
Copyright © 2012-2023 easychair.org. All rights reserved.