Sciweavers

186 search results - page 3 / 38
» Exceptional planar polynomials
Sort
View
AAECC
2009
Springer
142views Algorithms» more  AAECC 2009»
13 years 10 months ago
New Commutative Semifields and Their Nuclei
Abstract. Commutative semifields in odd characteristic can be equivalently described by planar functions (also known as PN functions). We describe a method to construct a semifield...
Jürgen Bierbrauer
MOC
1998
65views more  MOC 1998»
13 years 5 months ago
Exceptional units in a family of quartic number fields
Abstract. We determine all exceptional units among the elements of certain groups of units in quartic number fields. These groups arise from a oneparameter family of polynomials w...
Gerhard Niklasch, Nigel P. Smart
ISAAC
1995
Springer
97views Algorithms» more  ISAAC 1995»
13 years 9 months ago
A Linear Time Algorithm For Finding Maximal Planar Subgraphs
Given an undirected graph G, the maximal planar subgraph problem is to determine a planar subgraph H of G such that no edge of G-H can be added to H without destroying planarity. P...
Wen-Lian Hsu
STACS
2007
Springer
14 years 4 days ago
Compact Forbidden-Set Routing
We study the following problem. Given a weighted planar graph G, assign labels L(v) to vertices so that given L(u), L(v) and L(x) for x ∈ X for any X ⊂ V (G), compute the dist...
Bruno Courcelle, Andrew Twigg
JGAA
2007
123views more  JGAA 2007»
13 years 6 months ago
A Polynomial Time Algorithm for Finding Nash Equilibria in Planar Win-Lose Games
Abstract. Two-player win-lose games have a simple directed graph representation. Exploiting this, we develop graph theoretic techniques for finding Nash equilibria in such games. ...
Louigi Addario-Berry, Neil Olver, Adrian Vetta