Planar Crossovers

Authors:
W. F. McColl
Affiliations:
Department of Computer Science, University of Warwick
Venue:
IEEE Transactions on Computers
Year:
1981

Citing 1
Cited 5

The monotone and planar circuit value problems are log space complete for P

ACM SIGACT News

Computational properties of argument systems satisfying graph-theoretic constraints

Artificial Intelligence
The Three-Color and Two-Color TantrixTM Rotation Puzzle Problems Are NP-Complete Via Parsimonious Reductions

Language and Automata Theory and Applications
Satisfiability Parsimoniously Reduces to the Tantrix™ Rotation Puzzle Problem

Fundamenta Informaticae - Machines, Computations and Universality, Part I
The three-color and two-color Tantrix™ rotation puzzle problems are NP-complete via parsimonious reductions

Information and Computation
Satisfiability Parsimoniously Reduces to the Tantrix™ Rotation Puzzle Problem

Fundamenta Informaticae - Machines, Computations and Universality, Part I

Quantified Score

Hi-index	14.98

Visualization

Abstract

Those bases which permit the realization of a planar crossover are characterized.