Crossref Citations
This Book has been
cited by the following publications. This list is generated based on data provided by Crossref.
Boros, Endre
Gurvich, Vladimir
and
Makino, Kazuhisa
2009.
Minimal and locally minimal games and game forms.
Discrete Mathematics,
Vol. 309,
Issue. 13,
p.
4456.
Lejeune, Miguel
2010.
Pattern-Based Modeling and Solution of Probabilistically Constrained Optimization Problems.
SSRN Electronic Journal,
Boros, Endre
Gurvich, Vladimir
Makino, Kazuhisa
and
Papp, Dávid
2010.
Acyclic, or totally tight, two-person game forms: Characterization and main properties.
Discrete Mathematics,
Vol. 310,
Issue. 6-7,
p.
1135.
Cicalese, Ferdinando
and
Milanič, Martin
2011.
Competitive evaluation of threshold functions in the priced information model.
Annals of Operations Research,
Vol. 188,
Issue. 1,
p.
111.
Karaşan, O. Ekin
2011.
Incremental polynomial time dualization of quadratic functions and a subclass of degree-k functions.
Annals of Operations Research,
Vol. 188,
Issue. 1,
p.
251.
Boros, Endre
Crama, Yves
Hammer, Peter L.
Ibaraki, Toshihide
Kogan, Alexander
and
Makino, Kazuhisa
2011.
Logical analysis of data: classification with justification.
Annals of Operations Research,
Vol. 188,
Issue. 1,
p.
33.
Živný, Stanislav
2012.
The Complexity of Valued Constraint Satisfaction Problems.
p.
3.
Couceiro, Miguel
and
Lehtonen, Erkko
2012.
Galois theory for sets of operations closed under permutation, cylindrification, and composition.
Algebra universalis,
Vol. 67,
Issue. 3,
p.
273.
Živný, Stanislav
2012.
The Complexity of Valued Constraint Satisfaction Problems.
p.
79.
Couceiro, M.
Marichal, J-L
and
Waldhauser, T.
2012.
Hierarchies of Local Monotonicities and Lattice Derivatives for Boolean and Pseudo-Boolean Functions.
p.
262.
Lejeune, Miguel A.
2012.
Pattern-Based Modeling and Solution of Probabilistically Constrained Optimization Problems.
Operations Research,
Vol. 60,
Issue. 6,
p.
1356.
Li, Pingke
and
Jin, Qingwei
2012.
Fuzzy relational equations with min-biimplication composition.
Fuzzy Optimization and Decision Making,
Vol. 11,
Issue. 2,
p.
227.
Thapper, Johan
and
Zivny, Stanislav
2012.
The Power of Linear Programming for Valued CSPs.
p.
669.
Colic, J.
Machida, H.
and
Pantovic, J.
2012.
Clones of Incompletely Specified Operations.
p.
256.
Živný, Stanislav
2012.
The Complexity of Valued Constraint Satisfaction Problems.
p.
49.
CRAMA, YVES
and
LERUTH, LUC
2013.
POWER INDICES AND THE MEASUREMENT OF CONTROL IN CORPORATE STRUCTURES.
International Game Theory Review,
Vol. 15,
Issue. 03,
p.
1340017.
Movsisyan, Yuri M.
and
Aslanyan, Vahagn A.
2013.
On computation of De Morgan and quasi-De Morgan functions.
p.
1.
Blais, Eric
and
Tan, Li-Yang
2013.
Approximating Boolean Functions with Depth-2 Circuits.
p.
74.
Kullmann, Oliver
and
Zhao, Xishun
2013.
On Davis–Putnam reductions for minimally unsatisfiable clause-sets.
Theoretical Computer Science,
Vol. 492,
Issue. ,
p.
70.
Gwynne, Matthew
and
Kullmann, Oliver
2013.
SOFSEM 2013: Theory and Practice of Computer Science.
Vol. 7741,
Issue. ,
p.
220.