This repository provides the code necessary to reproduce the results in the paper "A theoretical approach to the size-complexity rule". It comprises two codes: one for the spherical and linear geometries, in C++11, and the other for the snowflake geometry, in python3
AbstractInformation about the size of spatial regions is often easily accessible and, when combined ...
Consider the supposedly simple problem of computing a point in a convex set that is conveyed by a s...
This is a special issue that grew out of work presented at The International Workshop on The Complex...
The so-called size-complexity rule claims the existence of a positive correlation between organism s...
Abstract: "In this paper, some results on the complexity of computing the combinatorial diameter of ...
In this paper we present a study of the linear programming technique developed by Delsarte, Goethal ...
The worst-case time and space complexity of many algorithms in computational geometry is high when ...
Abstract. We present a tool to automatically perform the data-size analysis of imperative programs w...
A definition is proposed for a size measure to be used as a parameter for algorithm analysis in any ...
AbstractA definition is proposed for a size measure to be used as a parameter for algorithm analysis...
The present paper is a companion to [2], in which a general definition of straight-line program leng...
In this paper we give an outline of Size Theory and its mainresults. The usefulness of such a theory...
A spherical code is a finite set of points on the surface of a multidimensional unit radius sphere. ...
We present new upper bounds on the size of constant-weight binary codes, derived from bounds for sph...
AbstractWe introduce a new approach which facilitates the calculation of the covering radius of a bi...
AbstractInformation about the size of spatial regions is often easily accessible and, when combined ...
Consider the supposedly simple problem of computing a point in a convex set that is conveyed by a s...
This is a special issue that grew out of work presented at The International Workshop on The Complex...
The so-called size-complexity rule claims the existence of a positive correlation between organism s...
Abstract: "In this paper, some results on the complexity of computing the combinatorial diameter of ...
In this paper we present a study of the linear programming technique developed by Delsarte, Goethal ...
The worst-case time and space complexity of many algorithms in computational geometry is high when ...
Abstract. We present a tool to automatically perform the data-size analysis of imperative programs w...
A definition is proposed for a size measure to be used as a parameter for algorithm analysis in any ...
AbstractA definition is proposed for a size measure to be used as a parameter for algorithm analysis...
The present paper is a companion to [2], in which a general definition of straight-line program leng...
In this paper we give an outline of Size Theory and its mainresults. The usefulness of such a theory...
A spherical code is a finite set of points on the surface of a multidimensional unit radius sphere. ...
We present new upper bounds on the size of constant-weight binary codes, derived from bounds for sph...
AbstractWe introduce a new approach which facilitates the calculation of the covering radius of a bi...
AbstractInformation about the size of spatial regions is often easily accessible and, when combined ...
Consider the supposedly simple problem of computing a point in a convex set that is conveyed by a s...
This is a special issue that grew out of work presented at The International Workshop on The Complex...
DOI
Add to ORKG