UB Paderborn / Katalog / Suche / in CDI

1 – 25 von 228

Sortiert nach

Approximating Minimum Representations of Key Horn Functions

SIAM journal on computing, 2022-02, Vol.51 (1), p.116-138

2022

Volltextzugriff (PDF)

Sprague-Grundy function of matroids and related hypergraphs

Theoretical computer science, 2019-12, Vol.799, p.40-58

2019

Volltextzugriff (PDF)

Compact quadratizations for pseudo-Boolean functions

Journal of combinatorial optimization, 2020-04, Vol.39 (3), p.687-707

2020

Volltextzugriff (PDF)

Dataset of Edmonds’ bi-vectors and tri-vectors with realizations

Data in brief, 2024-10, Vol.56, p.110785, Article 110785

2024

Volltextzugriff (PDF)

On the Sprague–Grundy function of extensions of proper Nim

International journal of game theory, 2021-09, Vol.50 (3), p.635-654

2021

Volltextzugriff (PDF)

A decomposition method for CNF minimality proofs

Theoretical computer science, 2013-10, Vol.510, p.111-126

2013

Volltextzugriff (PDF)

Generating minimal redundant and maximal irredundant subhypergraphs

Discrete Applied Mathematics, 2024-12, Vol.358, p.217-229

2024

Volltextzugriff (PDF)

Hardness results for approximate pure Horn CNF formulae minimization

Annals of mathematics and artificial intelligence, 2014-08, Vol.71 (4), p.327-363

2014

Volltextzugriff (PDF)

A Potential Reduction Algorithm for Ergodic Two-Person Zero-Sum Limiting Average Payoff Stochastic Games

Combinatorial Optimization and Applications, p.694-709

Volltextzugriff (PDF)

A Potential Reduction Algorithm for Two-Person Zero-Sum Mean Payoff Stochastic Games

Dynamic games and applications, 2018-03, Vol.8 (1), p.22-41

2018

Volltextzugriff (PDF)

A nested family of $$\varvec{k}$$-total effective rewards for positional games

International journal of game theory, 2017-03, Vol.46 (1), p.263-293

2017

Volltextzugriff (PDF)

On Short Paths Interdiction Problems: Total and Node-Wise Limited Interdiction

Theory of computing systems, 2008-08, Vol.43 (2), p.204-233

2008

Volltextzugriff (PDF)

Local search heuristics for Quadratic Unconstrained Binary Optimization (QUBO)

Journal of heuristics, 2007-04, Vol.13 (2), p.99-132

2007

Volltextzugriff (PDF)

A graph cut algorithm for higher-order Markov Random Fields

2011 International Conference on Computer Vision, 2011, p.1020-1027

2011

Volltextzugriff (PDF)

Sufficient conditions for the existence of Nash equilibria in bimatrix games in terms of forbidden $$2 \times 2$$ 2 × 2 subgames

International journal of game theory, 2016-11, Vol.45 (4), p.1111-1131

2016

Volltextzugriff (PDF)

An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation

Discrete Applied Mathematics, 2006-11, Vol.154 (16), p.2350-2372

2006

Volltextzugriff (PDF)

Quadratic reformulations of nonlinear binary optimization problems

Mathematical programming, 2017-03, Vol.162 (1-2), p.115-144

2017

Volltextzugriff (PDF)

On Canonical Forms for Zero-Sum Stochastic Mean Payoff Games

Dynamic games and applications, 2013-06, Vol.3 (2), p.128-161

2013

Volltextzugriff (PDF)

Recognizing distributed approval voting forms and correspondences

Annals of operations research, 2024-05, Vol.336 (3), p.2091-2110

2024

Volltextzugriff (PDF)

A max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO)

Discrete optimization, 2008-05, Vol.5 (2), p.501-529

2008

Volltextzugriff (PDF)

Acyclic, or totally tight, two-person game forms: Characterization and main properties

Discrete mathematics, 2010-04, Vol.310 (6), p.1135-1151

2010

Volltextzugriff (PDF)

A subclass of Horn CNFs optimally compressible in polynomial time

Annals of mathematics and artificial intelligence, 2009-12, Vol.57 (3-4), p.249-291

2009

Volltextzugriff (PDF)

Hypergraph Horn Functions

SIAM journal on discrete mathematics, 2024-01, Vol.38 (2), p.1417-1437

2024

Volltextzugriff (PDF)

Matroid Horn functions

Journal of combinatorial theory. Series A, 2024-04, Vol.203, p.105838, Article 105838

2024

Volltextzugriff (PDF)

Deterministic n-person shortest path and terminal games on symmetric digraphs have Nash equilibria in pure stationary strategies

International journal of game theory, 2024-06, Vol.53 (2), p.449-473

2024

Volltextzugriff (PDF)

1 – 25 von 228

Suche als RSS-Feed

Suchergebnisse filtern

Filter anzeigen

Nur zeigen

Geprüft (Peer-Review)
(212)
Mit Volltextzugriff
(224)

Publikationsform

1 weiteren anzeigen...

Weniger anzeigen...

Sprache

Erscheinungsjahr

n.n

Neu hinzugefügt

... seit 90 Tagen
(2)

Menü

Weitere Dienste

Einstellungen

Approximating Minimum Representations of Key Horn Functions

Sprague-Grundy function of matroids and related hypergraphs

Compact quadratizations for pseudo-Boolean functions

Dataset of Edmonds’ bi-vectors and tri-vectors with realizations

On the Sprague–Grundy function of extensions of proper Nim

A decomposition method for CNF minimality proofs

Generating minimal redundant and maximal irredundant subhypergraphs

Hardness results for approximate pure Horn CNF formulae minimization

A Potential Reduction Algorithm for Ergodic Two-Person Zero-Sum Limiting Average Payoff Stochastic Games

A Potential Reduction Algorithm for Two-Person Zero-Sum Mean Payoff Stochastic Games

A nested family of $$\varvec{k}$$-total effective rewards for positional games

On Short Paths Interdiction Problems: Total and Node-Wise Limited Interdiction

Local search heuristics for Quadratic Unconstrained Binary Optimization (QUBO)

A graph cut algorithm for higher-order Markov Random Fields

Sufficient conditions for the existence of Nash equilibria in bimatrix games in terms of forbidden $$2 \times 2$$ 2 × 2 subgames

An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation

Quadratic reformulations of nonlinear binary optimization problems

On Canonical Forms for Zero-Sum Stochastic Mean Payoff Games

Recognizing distributed approval voting forms and correspondences

A max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO)

Acyclic, or totally tight, two-person game forms: Characterization and main properties

A subclass of Horn CNFs optimally compressible in polynomial time

Hypergraph Horn Functions

Matroid Horn functions

Deterministic n-person shortest path and terminal games on symmetric digraphs have Nash equilibria in pure stationary strategies

Suchergebnisse filtern