Reconstruction of binary matrices from absorbed projectionsBALOGH, E; KUBA, A; DEL LUNGO, A et al.Lecture notes in computer science. 2002, pp 392-403, issn 0302-9743, isbn 3-540-43380-5Conference Paper

Improved approximation algorithms for MAX NAE-SAT and MAX SATAVIDOR, Adi; BERKOVITCH, Ido; ZWICK, Uri et al.Lecture notes in computer science. 2006, pp 27-40, issn 0302-9743, isbn 3-540-32207-8, 1Vol, 14 p.Conference Paper

Constant ratio fixed-parameter approximation of the edge multicut problemMARX, Daniel; RAZGON, Igor.Information processing letters. 2009, Vol 109, Num 20, pp 1161-1166, issn 0020-0190, 6 p.Article

(2 + f(n))-SAT and its propertiesYUNLEI ZHAO; XIAOTIE DENG; LEE, C. H et al.Discrete applied mathematics. 2004, Vol 136, Num 1, pp 3-11, issn 0166-218X, 9 p.Article

Reductions for non-clausal theorem provingAGUILERA, G; DE GUZMAN, I. P; OJEDA-ACIEGO, M et al.Theoretical computer science. 2001, Vol 266, Num 1-2, pp 81-112, issn 0304-3975Article

Using clausal graphs to determine the computational complexity of k-bounded positive one-in-three SATDENMAN, Richard; FOSTER, Stephen.Discrete applied mathematics. 2009, Vol 157, Num 7, pp 1655-1659, issn 0166-218X, 5 p.Article

Decidable metric logicsHIRSHFELD, Yoram; RABINOVICH, Alex.Information and computation (Print). 2008, Vol 206, Num 12, pp 1425-1442, issn 0890-5401, 18 p.Article

Modular instantiation schemesECHENIM, Mnacho; PELTIER, Nicolas.Information processing letters. 2011, Vol 111, Num 20, pp 989-993, issn 0020-0190, 5 p.Article

Complexity results for some eigenvector problemsEITER, Thomas; GOTTLOB, Georg.International journal of computer mathematics. 2000, Vol 76, Num 1, pp 59-74, issn 0020-7160Article

Complexity of metric temporal logics with counting and the Pnueli modalitiesRABINOVICH, Alexander.Theoretical computer science. 2010, Vol 411, Num 22-24, pp 2331-2342, issn 0304-3975, 12 p.Article

On the universal and existential fragments of the μ-calculusHENZINGE, Thomas A; KUPFERMAN, Orna; MAJUMDAR, Rupak et al.Theoretical computer science. 2006, Vol 354, Num 2, pp 173-186, issn 0304-3975, 14 p.Conference Paper

Threshold properties of random boolean constraint satisfaction problemsISTRATE, Gabriel.Discrete applied mathematics. 2005, Vol 153, Num 1-3, pp 141-152, issn 0166-218X, 12 p.Conference Paper

Uniform satisfiability problem for local temporal logics over Mazurkiewicz tracesGASTIN, Paul; KUSKE, Dietrich.Information and computation (Print). 2010, Vol 208, Num 7, pp 797-816, issn 0890-5401, 20 p.Article

On the complexity of the two-variable guarded fragment with transitive guardsKIERONSKI, Emanuel.Information and computation (Print). 2006, Vol 204, Num 11, pp 1663-1703, issn 0890-5401, 41 p.Article

A polynomial-time algorithm to find an equitable home-away assignmentMIYASHIRO, Ryuhei; MATSUI, Tomomi.Operations research letters. 2005, Vol 33, Num 3, pp 235-241, issn 0167-6377, 7 p.Article

Satgraphs and independent domination. Part 1ZVEROVICH, Igor Edm.Theoretical computer science. 2006, Vol 352, Num 1-3, pp 47-56, issn 0304-3975, 10 p.Article

Effective preprocessing in SAT through variable and clause eliminationEEN, Niklas; BIERE, Armin.Lecture notes in computer science. 2005, pp 61-75, issn 0302-9743, isbn 3-540-26276-8, 15 p.Conference Paper

Improved exact algorithms for Max-SatJIANER CHEN; KANJ, Iyad A.Discrete applied mathematics. 2004, Vol 142, Num 1-3, pp 17-27, issn 0166-218X, 11 p.Article

Bounded fixed-parameter tractability: The case 2^poly(k)WEYER, Mark.Lecture notes in computer science. 2004, pp 49-60, issn 0302-9743, isbn 3-540-23071-8, 12 p.Conference Paper

Logics for approximate reasoning: Approximating classical logic from aboveFINGER, Marcelo; WASSERMANN, Renata.Lecture notes in computer science. 2002, pp 21-30, issn 0302-9743, isbn 3-540-00124-7, 10 p.Conference Paper

Categorisation of clauses in conjunctive normal forms : Minimally unsatisfiable sub-clause-sets and the lean kernelKULLMANN, Oliver; LYNCE, Ines; MARQUES-SILVA, Joao et al.Lecture notes in computer science. 2006, pp 22-35, issn 0302-9743, isbn 3-540-37206-7, 1Vol, 14 p.Conference Paper

Local consistencies in SATBESSIERE, Christian; HEBRARD, Emmanuel; WALSH, Toby et al.Lecture notes in computer science. 2004, pp 299-314, issn 0302-9743, isbn 3-540-20851-8, 16 p.Conference Paper

CTL⁺ is complete for double exponential timeJOHANNSEN, Jan; LANGE, Martin.Lecture notes in computer science. 2003, pp 767-775, issn 0302-9743, isbn 3-540-40493-7, 9 p.Conference Paper

Pruning processes and a new characterization of convex geometriesARDILA, Federico; MANEVA, Elitza.Discrete mathematics. 2009, Vol 309, Num 10, pp 3083-3091, issn 0012-365X, 9 p.Article

Solution to the satisfiability problem using a complete Grover search with trapped ionsYANG, Wan-Li; HUA WEI; FEI ZHOU et al.Journal of physics. B. Atomic, molecular and optical physics (Print). 2009, Vol 42, Num 14, issn 0953-4075, 145503.1-145503.8Article