Completeness and Reduction in Algebraic Complexity Theory - Algorithms and Computation in Mathematics
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783642086045, 9783662041796

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Separation Results and Future Directions

Completeness and Reduction in Algebraic Complexity Theory - Algorithms and Computation in Mathematics ◽

10.1007/978-3-662-04179-6_8 ◽

2000 ◽

pp. 135-147

Author(s):

Peter Bürgisser

Keyword(s):

Future Directions ◽

Separation Results

Download Full-text

Some Complete Families of Polynomials

Completeness and Reduction in Algebraic Complexity Theory - Algorithms and Computation in Mathematics ◽

10.1007/978-3-662-04179-6_3 ◽

2000 ◽

pp. 37-60

Author(s):

Peter Bürgisser

Download Full-text

Fast Evaluation of Representations of General Linear Groups

Completeness and Reduction in Algebraic Complexity Theory - Algorithms and Computation in Mathematics ◽

10.1007/978-3-662-04179-6_6 ◽

2000 ◽

pp. 105-116

Author(s):

Peter Bürgisser

Keyword(s):

General Linear ◽

Linear Groups ◽

Fast Evaluation ◽

General Linear Groups

Download Full-text

Cook’s versus Valiant’s Hypothesis

Completeness and Reduction in Algebraic Complexity Theory - Algorithms and Computation in Mathematics ◽

10.1007/978-3-662-04179-6_4 ◽

2000 ◽

pp. 61-79

Author(s):

Peter Bürgisser

Download Full-text

Valiant’s Algebraic Model of NP-Completeness

Completeness and Reduction in Algebraic Complexity Theory - Algorithms and Computation in Mathematics ◽

10.1007/978-3-662-04179-6_2 ◽

2000 ◽

pp. 11-36 ◽

Cited By ~ 1

Author(s):

Peter Bürgisser

Keyword(s):

Algebraic Model ◽

Np Completeness

Download Full-text

Introduction

Completeness and Reduction in Algebraic Complexity Theory - Algorithms and Computation in Mathematics ◽

10.1007/978-3-662-04179-6_1 ◽

2000 ◽

pp. 1-9

Author(s):

Peter Bürgisser

Download Full-text

The Structure of Valiant’s Complexity Classes

Completeness and Reduction in Algebraic Complexity Theory - Algorithms and Computation in Mathematics ◽

10.1007/978-3-662-04179-6_5 ◽

2000 ◽

pp. 81-103

Author(s):

Peter Bürgisser

Keyword(s):

Complexity Classes

Download Full-text

The Complexity of Immanants

Completeness and Reduction in Algebraic Complexity Theory - Algorithms and Computation in Mathematics ◽

10.1007/978-3-662-04179-6_7 ◽

2000 ◽

pp. 117-134

Author(s):

Peter Bürgisser

Download Full-text

Completeness and Reduction in Algebraic Complexity Theory - Algorithms and Computation in MathematicsLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Separation Results and Future Directions

Some Complete Families of Polynomials

Fast Evaluation of Representations of General Linear Groups

Cook’s versus Valiant’s Hypothesis

Valiant’s Algebraic Model of NP-Completeness

Introduction

The Structure of Valiant’s Complexity Classes

The Complexity of Immanants

Completeness and Reduction in Algebraic Complexity Theory - Algorithms and Computation in Mathematics
Latest Publications