arXiv 2018-12-31 EN Overview of Information Theory, Computer Science Theory, and Stochastic Thermodynamics for Thermodynamics of Computation Wolpert, David H.
arXiv 2018-10-01 EN Minimum-Link Rectilinear Covering Tour is NP-hard in R⁴ Chitturi, Bhadrachalam · Pai, Jayakumar
arXiv 2018-09-12 EN A Simple Elementary Proof of P=NP based on the Relational Model of E. F. Codd Li, Aizhong
arXiv 2017-09-25 EN A new algorithm for constraint satisfaction problems with Maltsev templates Delic, Dejan · Habte, Aklilu
arXiv 2017-06-12 EN Constraint Satisfaction Problem Dichotomy for Finite Templates: a Proof Via Consistency Checks Delić, Dejan
arXiv 2014-11-12 EN On the complexity of finding falsifying assignments for Herbrand disjunctions Pudlak, Pavel
arXiv 2014-10-23 EN A type assignment for lambda-calculus complete both for FPTIME and strong normalization De Benedetti, Erika · Della Rocca, Simona Ronchi
arXiv 2013-06-10 EN Paradigms for Parameterized Enumeration Creignou, Nadia · Meier, Arne · Müller, Julian-Steffen · Schmidt, Johannes +1
arXiv 2013-04-16 EN The Control Complexity of r-Approval: from the Single-Peaked Case to the General Case Yang, Yongjie · Guo, Jiong
arXiv 2010-10-06 EN A Path Order for Rewrite Systems that Compute Exponential Time Functions (Technical Report) Avanzini, Martin · Eguchi, Naohi · Moser, Georg
