AbstractIt is proved that there exist encoding schemes which are arbitrarily as efficient as the binary encoding (in terms of compactness and arithmetic operations), with respect to which Khachiyan's algorithm for Linear Programming is exponential. This constitutes an objection to the standard translation of problems into languages via the binary encoding
In the first part, we introduce binary representations of both lambda calculus and combinatory logic...
ge like Pascal, C, Lisp, or whatever. We will restrict attention to programs that have no input, so ...
We give an alternative proof of Delsarte's linear programming bound for binary codes and its im...
AbstractIt is proved that there exist encoding schemes which are arbitrarily as efficient as the bin...
AbstractWe describe an effective method for doing binary-encoded modeling, in the context of 0/1 lin...
A non-binary Constraint Satisfaction Problem (CSP) can be solved directly using ex-tended versions o...
In this paper we prove an exponential separation between two very similar and natural SAT encodings ...
The basic notion of encoding is one of the most important present in computer science. So far, they ...
Giving types to binary methods causes signi cant problems for object-oriented language designers and...
In the first part, we introduce binary representations of both lambda calculus and combinatory logic...
This paper is dedicated to the complexity comparison of adaptive binary arithmetic coding integer so...
The purpose of this paper is to define a mathematical model for the study of quantitative problems a...
Abstract. A non-binary Constraint Satisfaction Problem (CSP) can be solved by converting the problem...
AbstractA string p is called a program to compute y given x if U(p,x)=y, where U denotes universal p...
We show that real-value approximations of Kolmogorov-Chaitin (Km) using the algorithmic Coding theor...
In the first part, we introduce binary representations of both lambda calculus and combinatory logic...
ge like Pascal, C, Lisp, or whatever. We will restrict attention to programs that have no input, so ...
We give an alternative proof of Delsarte's linear programming bound for binary codes and its im...
AbstractIt is proved that there exist encoding schemes which are arbitrarily as efficient as the bin...
AbstractWe describe an effective method for doing binary-encoded modeling, in the context of 0/1 lin...
A non-binary Constraint Satisfaction Problem (CSP) can be solved directly using ex-tended versions o...
In this paper we prove an exponential separation between two very similar and natural SAT encodings ...
The basic notion of encoding is one of the most important present in computer science. So far, they ...
Giving types to binary methods causes signi cant problems for object-oriented language designers and...
In the first part, we introduce binary representations of both lambda calculus and combinatory logic...
This paper is dedicated to the complexity comparison of adaptive binary arithmetic coding integer so...
The purpose of this paper is to define a mathematical model for the study of quantitative problems a...
Abstract. A non-binary Constraint Satisfaction Problem (CSP) can be solved by converting the problem...
AbstractA string p is called a program to compute y given x if U(p,x)=y, where U denotes universal p...
We show that real-value approximations of Kolmogorov-Chaitin (Km) using the algorithmic Coding theor...
In the first part, we introduce binary representations of both lambda calculus and combinatory logic...
ge like Pascal, C, Lisp, or whatever. We will restrict attention to programs that have no input, so ...
We give an alternative proof of Delsarte's linear programming bound for binary codes and its im...
DOI
Add to ORKG