ERD

Generalized satisfiability problems via operator assignments

Project: AUTAR

Updated at: 27-04-2024

Show more information

Project acronym AUTAR

Feasibly constructive proofs of succinct weak circuit lower bounds

Project: AUTAR

Updated at: 27-04-2024

Show more information

Project acronym AUTAR

Probabilities of first-order sentences on sparse random relational structures: an application to definability on random ...

Project: AUTAR

Updated at: 27-04-2024

Show more information

Project acronym AUTAR

The parameterized space complexity of model-checking bounded variable first-order logic

Project: AUTAR

Updated at: 27-04-2024

Show more information

Project acronym AUTAR

Automating Resolution is NP-Hard

Project: AUTAR

Updated at: 27-04-2024

Show more information

Project acronym AUTAR

Polynomial time ultrapowers and the consistency of circuit lower bounds

Project: AUTAR

Updated at: 27-04-2024

Show more information

Project acronym AUTAR

Trade-offs Between Time and Memory in a Tighter Model of CDCL SAT Solvers

Project: AUTAR

Updated at: 27-04-2024

Show more information

Project acronym AUTAR

Homomorphism Problems for First-Order Definable Structures

Project: AUTAR

Updated at: 27-04-2024

Show more information

Project acronym AUTAR

Proof Complexity Meets Algebra

Project: AUTAR

Updated at: 27-04-2024

Show more information

Project acronym AUTAR

On the Power of Symmetric Linear Programs

Project: AUTAR

Updated at: 27-04-2024

Show more information

Project acronym AUTAR

Size-Degree Trade-Offs for Sums-of-Squares and Positivstellensatz Proofs

Project: AUTAR

Updated at: 27-04-2024

Show more information

Project acronym AUTAR

Proof Complexity Meets Algebra

Project: AUTAR

Updated at: 27-04-2024

Show more information

Project acronym AUTAR

Derandomizing Isolation in Space-Bounded Settings

Project: AUTAR

Updated at: 27-04-2024

Show more information

Project acronym AUTAR

Non-Homogenizable Classes of Finite Structures

Project: AUTAR

Updated at: 27-04-2024

Show more information

Project acronym AUTAR

Graph Colouring is Hard for Algorithms Based on Hilbert's Nullstellensatz and Gröbner Bases

Project: AUTAR

Updated at: 27-04-2024

Show more information

Project acronym AUTAR

Generalized Satisfiability Problems via Operator Assignments

Project: AUTAR

Updated at: 27-04-2024

Show more information

Project acronym AUTAR

Entropy Bounds for Conjunctive Queries with Functional Dependencies

Project: AUTAR

Updated at: 27-04-2024

Show more information

Project acronym AUTAR

A parameterized halting problem, the linear time hierarchy, and the MRDP theorem

Project: AUTAR

Updated at: 27-04-2024

Show more information

Project acronym AUTAR

Automating Resolution is NP-Hard

Project: AUTAR

Updated at: 27-04-2024

Show more information

Project acronym AUTAR

Relative Entailment Among Probabilistic Implications

Project: AUTAR

Updated at: 27-04-2024

Show more information

Project acronym AUTAR

Co-occurrence patterns in diagnostic data

Project: AUTAR

Updated at: 27-04-2024

Show more information

Project acronym AUTAR

Feasible Interpolation for Polynomial Calculus and Sums-Of-Squares

Project: AUTAR

Updated at: 27-04-2024

Show more information

Project acronym AUTAR

Resolution Lower Bounds for Refutation Statements

Project: AUTAR

Updated at: 27-04-2024

Show more information

Project acronym AUTAR

Quantum and non-signalling graph isomorphisms

Project: AUTAR

Updated at: 27-04-2024

Show more information

Project acronym AUTAR

Clique is hard on average for regular resolution

Project: AUTAR

Updated at: 27-04-2024

Show more information

Project acronym AUTAR

Incomplete SMT Techniques for Solving Non-Linear Formulas over the Integers

Project: AUTAR

Updated at: 27-04-2024

Show more information

Project acronym AUTAR

Circular (Yet Sound) Proofs

Project: AUTAR

Updated at: 27-04-2024

Show more information

Project acronym AUTAR

A remark on pseudo proof systems and hard instances of the satisfiability problem

Project: AUTAR

Updated at: 27-04-2024

Show more information

Project acronym AUTAR

Definable inapproximability: new challenges for duplicator

Project: AUTAR

Updated at: 27-04-2024

Show more information

Project acronym AUTAR

Definable Ellipsoid Method, Sums-of-Squares Proofs, and the Isomorphism Problem

Project: AUTAR

Updated at: 27-04-2024

Show more information

Project acronym AUTAR

Resources

Selected filters:

Generalized satisfiability problems via operator assignments

Feasibly constructive proofs of succinct weak circuit lower bounds

Probabilities of first-order sentences on sparse random relational structures: an application to definability on random ...

The parameterized space complexity of model-checking bounded variable first-order logic

Automating Resolution is NP-Hard

Polynomial time ultrapowers and the consistency of circuit lower bounds

Trade-offs Between Time and Memory in a Tighter Model of CDCL SAT Solvers

Homomorphism Problems for First-Order Definable Structures

Proof Complexity Meets Algebra

On the Power of Symmetric Linear Programs

Size-Degree Trade-Offs for Sums-of-Squares and Positivstellensatz Proofs

Proof Complexity Meets Algebra

Derandomizing Isolation in Space-Bounded Settings

Non-Homogenizable Classes of Finite Structures

Graph Colouring is Hard for Algorithms Based on Hilbert's Nullstellensatz and Gröbner Bases

Generalized Satisfiability Problems via Operator Assignments

Entropy Bounds for Conjunctive Queries with Functional Dependencies

A parameterized halting problem, the linear time hierarchy, and the MRDP theorem

Automating Resolution is NP-Hard

Relative Entailment Among Probabilistic Implications

Co-occurrence patterns in diagnostic data

Feasible Interpolation for Polynomial Calculus and Sums-Of-Squares

Resolution Lower Bounds for Refutation Statements

Quantum and non-signalling graph isomorphisms

Clique is hard on average for regular resolution

Incomplete SMT Techniques for Solving Non-Linear Formulas over the Integers

Circular (Yet Sound) Proofs

A remark on pseudo proof systems and hard instances of the satisfiability problem

Definable inapproximability: new challenges for duplicator

Definable Ellipsoid Method, Sums-of-Squares Proofs, and the Isomorphism Problem