Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
There is a class of higher derivative gravity theories that are in some sense natural extensions of cosmological Einstein's… 
2014
2014
These lecture notes consist of three chapters. In the first chapter we present oracle inequalities for the prediction error of… 
2012
2012
We address the problem of robust formant tracking in continuous speech in the presence of additive noise. We propose a new… 
2011
2011
We study the generic properties of finitely presented monoids and semigroups, and the generic-case complexity of decision… 
2011
2011
Purpose: The aim of the paper is to present the methodology used to manage an extensive e-learning project at the Czestochowa… 
2007
2007
Fischer and Rabin proved in (Proceedings of the SIAM-AMS Symposium in Applied Mathematics, vol. 7, pp. 27–41, 1974) that the… 
2006
2006
Instruction set randomization (ISR) has been proposed as a form of defense against binary code injection into an executing… 
2006
2006
Refactoring is about changing the design of existing code without changing its behaviour, but with the aim of making code easier… 
1996
1996
The paper studies generic commutative and anticommutative algebras of a fixed dimension, their invariants, covariants and…