4   Artículos

 
en línea
Rebekah Herrman, Lorna Treffert, James Ostrowski, Phillip C. Lotshaw, Travis S. Humble and George Siopsis    
We develop a global variable substitution method that reduces n-variable monomials in combinatorial optimization problems to equivalent instances with monomials in fewer variables. We apply this technique to 3-SAT and analyze the optimal quantum unitary ... ver más
Revista: Algorithms    Formato: Electrónico

 
en línea
Gábor Kusper and Csaba Biró    
In a previous paper we defined the black and white SAT problem which has exactly two solutions, where each variable is either true or false. We showed that black and white 2-SAT problems represent strongly connected directed graphs. We presented also the... ver más
Revista: Algorithms    Formato: Electrónico

« Anterior     Página: 1 de 1     Siguiente »