13603 search results - page 216 / 2721 » On the Computational Complexity of Cut-Reduction |
193
click to vote
CONIELECOMP
2004
IEEE
15 years 10 months ago
2004
IEEE
In this paper we present a set of formulations that describe some properties of the configurations that can represent the n-Dimensional Orthogonal PseudoPolytopes. Moreover, we de...
151
click to vote
FPL
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. This paper presents a new data representation known as Dual FiXedpoint (DFX), which employs a single bit exponent to select two different fixedpoint scalings. DFX provide...
176
click to vote
SIGACT
2008
15 years 6 months ago
2008
Two long-open problems have been solved: (1) every sufficiently large planar point set in general position contains the vertices of an empty hexagon; (2) every finite collection o...
151
click to vote
IJFCS
2007
15 years 6 months ago
2007
The process of gene assembly in ciliates, an ancient group of organisms, is one of the most complex instances of DNA manipulation known in any organism. Three molecular operations...
165
Voted
SIAMNUM
2010
15 years 1 months ago
2010
Polynomials with quaternionic coefficients located on only one side of the powers (we call them simple polynomials) may have two different types of zeros: isolated and spherical ze...