Pages that link to "Item:Q1137948"

The following pages link to Complexity of problems in games, graphs and algebraic equations (Q1137948):

Displaying 21 items.

• The complexity of node blocking for dags (Q616455) (← links)
• The complexity of pursuit on a graph (Q673639) (← links)
• On the domination numbers of generalized de Bruijn digraphs and generalized Kautz digraphs (Q1007577) (← links)
• PSPACE-Hardness of some combinatorial games (Q1090274) (← links)
• Complexity of solving algebraic equations (Q1165578) (← links)
• Planar kernel and Grundy with \(d\leq 3\), \(dout\leq 2\), \(din\leq 2\) are NP- complete (Q1168729) (← links)
• Theory of annihilation games. I (Q1168901) (← links)
• The complexity of coloring games on perfect graphs (Q1202928) (← links)
• Undirected edge geography (Q1210301) (← links)
• Recent results and questions in combinatorial game complexities (Q1583532) (← links)
• Traveling salesmen in the presence of competition (Q1884998) (← links)
• Complexity, appeal and challenges of combinatorial games (Q1884999) (← links)
• Practical complexities of probabilistic algorithms for solving Boolean polynomial systems (Q2065761) (← links)
• Estimation of the complexity of the potential transformation algorithm for solving cyclic games on graphs (Q2290510) (← links)
• Consensus networks over finite fields (Q2628411) (← links)
• (Q2741527) (← links)
• On Cryptographically Significant Mappings over GF(2 n ) (Q3519562) (← links)
• Algebraic Geometry and Finite Frames (Q4912894) (← links)
• (Q5091175) (← links)
• Key recovery attack on Circulant UOV/Rainbow (Q5236559) (← links)
• An improvement of algorithms to solve under-defined systems of multivariate quadratic equations (Q6139474) (← links)