Complexity of problems in games, graphs and algebraic equations
From MaRDI portal
Publication:1137948
DOI10.1016/0166-218X(79)90012-XzbMath0429.90103MaRDI QIDQ1137948
Aviezri S. Fraenkel, Yaacov Yesha
Publication date: 1979
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
computational complexitycombinatorial game theoryNP-complete graph problemsboard gamesclassical NP-hard abstract algebraic problemsexistence of solutions of algebraic equationsNP-complete abstract algebraic problemsNP-hard games
Analysis of algorithms and problem complexity (68Q25) Extremal problems in graph theory (05C35) Numerical computation of solutions to systems of equations (65H10) Game theory (91A99)
Related Items
Traveling salesmen in the presence of competition, Complexity, appeal and challenges of combinatorial games, PSPACE-Hardness of some combinatorial games, Consensus networks over finite fields, Unnamed Item, The complexity of node blocking for dags, An improvement of algorithms to solve under-defined systems of multivariate quadratic equations, On Cryptographically Significant Mappings over GF(2 n ), Complexity of solving algebraic equations, Planar kernel and Grundy with \(d\leq 3\), \(dout\leq 2\), \(din\leq 2\) are NP- complete, Theory of annihilation games. I, The complexity of pursuit on a graph, Algebraic Geometry and Finite Frames, The complexity of coloring games on perfect graphs, Undirected edge geography, Unnamed Item, Estimation of the complexity of the potential transformation algorithm for solving cyclic games on graphs, On the domination numbers of generalized de Bruijn digraphs and generalized Kautz digraphs, Practical complexities of probabilistic algorithms for solving Boolean polynomial systems, Key recovery attack on Circulant UOV/Rainbow, Recent results and questions in combinatorial game complexities
Cites Work
