The following pages link to Albert Atserias (Q458459):
Displaying 50 items.
- Book review of: E. Grädel, P. Kolaitis, L. Libkin, M. Marx, I. Spencer, M. Vardi, Y. Venema, S. Weinstein, Finite model theory and its applications (Q458460) (← links)
- Mean-payoff games and propositional proofs (Q716324) (← links)
- Conjunctive query evaluation by search-tree revisited (Q870265) (← links)
- Affine systems of equations and counting infinitary logic (Q1014638) (← links)
- Improved bounds on the weak pigeonhole principle and infinitely many primes from weaker axioms (Q1401230) (← links)
- Lower bounds for the weak pigeonhole principle and random formulas beyond resolution (Q1854546) (← links)
- Monotone simulations of non-monotone proofs. (Q1872729) (← links)
- On the automatizability of resolution and related propositional proof systems (Q1881219) (← links)
- Circular (yet sound) proofs (Q2181918) (← links)
- Partially definable forcing and bounded arithmetic (Q2257103) (← links)
- Quantum and non-signalling graph isomorphisms (Q2421559) (← links)
- On digraph coloring problems and treewidth duality (Q2427534) (← links)
- Bounded-width QBF is PSPACE-complete (Q2453562) (← links)
- A combinatorial characterization of resolution width (Q2475405) (← links)
- (Q2753672) (← links)
- (Q2754140) (← links)
- Monotone Proofs of the Pigeon Hole Principle (Q2765569) (← links)
- Sherali-Adams relaxations and indistinguishability in counting logics (Q2826069) (← links)
- Sherali--Adams Relaxations and Indistinguishability in Counting Logics (Q2839173) (← links)
- Size Bounds and Query Plans for Relational Joins (Q2862210) (← links)
- The Ordering Principle in a Fragment of Approximate Counting (Q2946740) (← links)
- Bounded-width QBF is PSPACE-complete (Q2957870) (← links)
- Degree Lower Bounds of Tower-Type for Approximating Formulas with Parity Quantifiers (Q3167000) (← links)
- Preservation under Extensions on Well-Behaved Finite Structures (Q3395035) (← links)
- On preservation under homomorphisms and unions of conjunctive queries (Q3546314) (← links)
- Mean-Payoff Games and Propositional Proofs (Q3587372) (← links)
- Decidable Relationships between Consistency Notions for Constraint Satisfaction Problems (Q3644743) (← links)
- (Q4411848) (← links)
- (Q4535079) (← links)
- Proof Complexity Meets Algebra (Q4617977) (← links)
- (Q4625699) (← links)
- Entailment among Probabilistic Implications (Q4635841) (← links)
- (Q4779142) (← links)
- (Q5002801) (← links)
- Clique Is Hard on Average for Regular Resolution (Q5056413) (← links)
- On the Power of Symmetric Linear Programs (Q5056416) (← links)
- Definable Inapproximability: New Challenges for Duplicator (Q5079727) (← links)
- Size-degree trade-offs for sums-of-squares and positivstellensatz proofs (Q5091776) (← links)
- Proof complexity meets algebra (Q5111442) (← links)
- Automating Resolution is NP-Hard (Q5133983) (← links)
- Definable Ellipsoid Method, Sums-of-Squares Proofs, and the Isomorphism Problem (Q5145277) (← links)
- Definable inapproximability: new challenges for duplicator (Q5216336) (← links)
- Clique is hard on average for regular resolution (Q5230344) (← links)
- Narrow Proofs May Be Maximally Long (Q5277920) (← links)
- Non-Homogenizable Classes of Finite Structures (Q5278402) (← links)
- Computer Science Logic (Q5311247) (← links)
- Database Theory - ICDT 2005 (Q5316615) (← links)
- The Proof-Search Problem between Bounded-Width Resolution and Bounded-Degree Semi-algebraic Proofs (Q5326450) (← links)
- Degree lower bounds of tower-type for approximating formulas with parity quantifiers (Q5410333) (← links)
- On the Power of k-Consistency (Q5428816) (← links)
