scientific article; zbMATH DE number 1180007

zbMATH Open0908.65142MaRDI QIDQ4399282FDOQ4399282

Authors:

Publication date: 8 March 1999

Title of this publication is not available (Why is that?)

Recommendations

• On the theory of average case complexity
• On the Average Case Complexity of Some P-complete Problems
• scientific article; zbMATH DE number 1072538
• Encoding invariance in average case complexity
• scientific article; zbMATH DE number 1222584
• Average-case intractability vs. worst-case intractability
• On the average-case complexity of underdetermined functions
• Average case complexity, revisited
• Average-case analysis of algorithms using Kolmogorov complexity
• Worst-case complexity, average-case complexity and lattice problems

zbMATH Keywords

finite element methodaverage case complexityshift-invariant problem

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20) Analysis of algorithms and problem complexity (68Q25) General theory of numerical analysis in abstract spaces (65J05) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30)

Cited In (1)

• The value of help bits in randomized and average-case complexity

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4399282)