The complexity of combinatorial problems with succinct input representation
- Wagner, Klaus (Prof.)
DOIAbstract
The complexity of combinatorial problems with succinct input representation. - In: Acta informatica. 23. 1986. S. 325-356
The complexity of combinatorial problems with succinct input representation. - In: Acta informatica. 23. 1986. S. 325-356
At its core, much of Computational Complexity is concerned with combinatorial objects and structures...
We describe a computer program that has been used to maintain a record of the known complexity resul...
Smoothed analysis combines elements over worst-case and average case analysis. For an instance $x$, ...
The complexity of combinatorial problems with succinct input representation. - In: Acta informatica....
Thesis (Ph. D.)--University of Rochester. Dept. of Computer Science, 2004. Simultaneously published...
Article dans revue scientifique avec comité de lecture.We study the computational complexity of the ...
Abstract:- We present a hypothetical approach to support existing methods in dealing with combinator...
A fundamental problem in computer science is, stated informally: Given a problem, how hard is it?. W...
For a fixed graph property Q, the complexity of the problem: Given a graph G, does G have property Q...
AbstractIt has long been observed that certain factorization algorithms provide a way to write the p...
A computation consists of algorithm of basic operations. When you consider an algorithm, you assume,...
This paper approaches computational complexity as the determination of the intrinsic difficulty of m...
We describe a computer program that has been used to maintain a record of the known complexity resul...
Smoothed analysis combines elements over worst-case and average case analysis. For an instance x the...
We describe a computer program that has been used to maintain a record of the known complexity resul...
At its core, much of Computational Complexity is concerned with combinatorial objects and structures...
We describe a computer program that has been used to maintain a record of the known complexity resul...
Smoothed analysis combines elements over worst-case and average case analysis. For an instance $x$, ...
The complexity of combinatorial problems with succinct input representation. - In: Acta informatica....
Thesis (Ph. D.)--University of Rochester. Dept. of Computer Science, 2004. Simultaneously published...
Article dans revue scientifique avec comité de lecture.We study the computational complexity of the ...
Abstract:- We present a hypothetical approach to support existing methods in dealing with combinator...
A fundamental problem in computer science is, stated informally: Given a problem, how hard is it?. W...
For a fixed graph property Q, the complexity of the problem: Given a graph G, does G have property Q...
AbstractIt has long been observed that certain factorization algorithms provide a way to write the p...
A computation consists of algorithm of basic operations. When you consider an algorithm, you assume,...
This paper approaches computational complexity as the determination of the intrinsic difficulty of m...
We describe a computer program that has been used to maintain a record of the known complexity resul...
Smoothed analysis combines elements over worst-case and average case analysis. For an instance x the...
We describe a computer program that has been used to maintain a record of the known complexity resul...
At its core, much of Computational Complexity is concerned with combinatorial objects and structures...
We describe a computer program that has been used to maintain a record of the known complexity resul...
Smoothed analysis combines elements over worst-case and average case analysis. For an instance $x$, ...
Add to ORKG