Sciweavers

414 search results - page 30 / 83
» Geometric Semigroup Theory
Sort
View
COMPGEOM
2010
ACM
14 years 20 days ago
Adding one edge to planar graphs makes crossing number hard
A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show that it is NP-hard to compute the crossing number of near-planar graphs. The main idea ...
Sergio Cabello, Bojan Mohar
COMPGEOM
2005
ACM
13 years 9 months ago
Shortest path amidst disc obstacles is computable
An open question in Exact Geometric Computation is whether there are transcendental computations that can be made “geometrically exact”. Perhaps the simplest such problem in c...
Ee-Chien Chang, Sung Woo Choi, DoYong Kwon, Hyungj...
EJC
2008
13 years 7 months ago
Eriksson's numbers game and finite Coxeter groups
The numbers game is a one-player game played on a finite simple graph with certain "amplitudes" assigned to its edges and with an initial assignment of real numbers to i...
Robert G. Donnelly
SAC
2010
ACM
13 years 2 months ago
Similar triangles and orientation in plane elementary geometry for Coq-based proofs
In plane elementary geometry, the concept of similar triangles not only forms an important foundation for trigonometry, but it also can be used to solve many geometric problems. T...
Tuan Minh Pham
STOC
2012
ACM
251views Algorithms» more  STOC 2012»
11 years 10 months ago
Minimax option pricing meets black-scholes in the limit
Option contracts are a type of financial derivative that allow investors to hedge risk and speculate on the variation of an asset’s future market price. In short, an option has...
Jacob Abernethy, Rafael M. Frongillo, Andre Wibiso...