Sciweavers

33 search results - page 1 / 7
» Set-theoretic solutions of the Yang-Baxter equation, graphs ...
Sort
View
JSC
2007
61views more  JSC 2007»
13 years 10 months ago
Set-theoretic solutions of the Yang-Baxter equation, graphs and computations
Abstract. We extend our recent work on set-theoretic solutions of the YangBaxter or braid relations with new results about their automorphism groups, strong twisted unions of solut...
Tatiana Gateva-Ivanova, Shahn Majid
ACPC
1999
Springer
14 years 3 months ago
Non-standard Parallel Solution Strategies for Distributed Sparse Linear Systems
Abstract. A number of techniques are described for solving sparse linear systems on parallel platforms. The general approach used is a domaindecomposition type method in which a pr...
Yousef Saad, Masha Sosonkina
DCC
2011
IEEE
13 years 5 months ago
Sparse Boolean equations and circuit lattices
Abstract. A system of Boolean equations is called sparse if each equation depends on a small number of variables. Finding efficiently solutions to the system is an underlying hard ...
Igor Semaev
DAM
2008
102views more  DAM 2008»
13 years 11 months ago
On the computational complexity of partial covers of Theta graphs
By use of elementary geometric arguments we prove the existence of a special integral solution of a certain system of linear equations. The existence of such a solution yields the...
Jirí Fiala, Jan Kratochvíl, Attila P...
CSR
2009
Springer
14 years 17 min ago
Approximability of the Maximum Solution Problem for Certain Families of Algebras
We study the approximability of the maximum solution problem. This problem is an optimisation variant of the constraint satisfaction problem and it captures a wide range of interes...
Peter Jonsson, Johan Thapper