A review of the catalytic oxidation of carbon–carbon composite aircraft brakes
M Bevilacqua, A Babutskyi, A Chrysanthou - Carbon, 2015 - Elsevier
The use of de-icing chemicals at airport runways has been shown to produce oxides and
carbonates of sodium, potassium and calcium which catalyse the oxidation of carbon …
carbonates of sodium, potassium and calcium which catalyse the oxidation of carbon …
Absorbing subalgebras, cyclic terms, and the constraint satisfaction problem
The Algebraic Dichotomy Conjecture states that the Constraint Satisfaction Problem over a
fixed template is solvable in polynomial time if the algebra of polymorphisms associated to …
fixed template is solvable in polynomial time if the algebra of polymorphisms associated to …
Constraint satisfaction problems of bounded width
Constraint Satisfaction Problems of Bounded Width Page 1 Constraint Satisfaction
Problems of Bounded Width Libor Barto ∗ Department of Algebra Charles University Prague …
Problems of Bounded Width Libor Barto ∗ Department of Algebra Charles University Prague …
The complexity of the counting constraint satisfaction problem
AA Bulatov - Journal of the ACM (JACM), 2013 - dl.acm.org
The Counting Constraint Satisfaction Problem (# CSP (H)) over a finite relational structure H
can be expressed as follows: given a relational structure G over the same vocabulary …
can be expressed as follows: given a relational structure G over the same vocabulary …
A complexity dichotomy for partition functions with mixed signs
LA Goldberg, M Grohe, M Jerrum, M Thurley - SIAM Journal on Computing, 2010 - SIAM
Partition functions, also known as homomorphism functions, form a rich family of graph
invariants that contain combinatorial invariants such as the number of k-colorings or the …
invariants that contain combinatorial invariants such as the number of k-colorings or the …
The dichotomy for conservative constraint satisfaction problems revisited
L Barto - 2011 IEEE 26th Annual Symposium on Logic in …, 2011 - ieeexplore.ieee.org
A central open question in the study of non-uniform constraint satisfaction problems (CSPs)
is the dichotomy conjecture of Feder and Vardi stating that the CSP over a fixed constraint …
is the dichotomy conjecture of Feder and Vardi stating that the CSP over a fixed constraint …
The complexity of the counting constraint satisfaction problem
AA Bulatov - International Colloquium on Automata, Languages …, 2008 - Springer
Abstract The Counting Constraint Satisfaction Problem (\rm\#CSP(H)) over a finite relational
structure H can be expressed as follows: given a relational structure G over the same …
structure H can be expressed as follows: given a relational structure G over the same …
The dichotomy of list homomorphisms for digraphs
Abstract The Dichotomy Conjecture for Constraint Satisfaction Problems has been verified
for conservative problems (or, equivalently, for list homomorphism problems) by Andrei …
for conservative problems (or, equivalently, for list homomorphism problems) by Andrei …
Tight lower bounds on graph embedding problems
We prove that unless the Exponential Time Hypothesis (ETH) fails, deciding if there is a
homomorphism from graph G to graph H cannot be done in time| V (H)| o (| V (G)|). We also …
homomorphism from graph G to graph H cannot be done in time| V (H)| o (| V (G)|). We also …
Enumerating homomorphisms
The homomorphism problem for relational structures is an abstract way of formulating
constraint satisfaction problems (CSP) and various problems in database theory. The …
constraint satisfaction problems (CSP) and various problems in database theory. The …