Generic-case complexity

Known as: Generic case complexity

Generic-case complexity is a subfield of computational complexity theory that studies the complexity of computational problems on "most inputs…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2019

2018

We show that, for a closed orientable [Formula: see text]-manifold, with [Formula: see text] not congruent to 3 modulo 4, the…

2017

There is a class of higher derivative gravity theories that are in some sense natural extensions of cosmological Einstein's…

2015

To harness the power of multi-core and distributed platforms, and to make the development of concurrent software more accessible…

2014

These lecture notes consist of three chapters. In the first chapter we present oracle inequalities for the prediction error of…

2011

We study the generic properties of finitely presented monoids and semigroups, and the generic-case complexity of decision…

2007

Fischer and Rabin proved in (Proceedings of the SIAM-AMS Symposium in Applied Mathematics, vol. 7, pp. 27–41, 1974) that the…

1995

The robustness of transponding commercial satcom to uplink jamming is investigated. It is assumed that the transponder is…

Review

1992

Review

1992

1991