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)

Related topics

Related topics

20 relations
AlgorithmAnshel–Anshel–Goldfeld key exchangeAverage-case complexityComputational complexity theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Entropy in Born-Infeld gravity
There is a class of higher derivative gravity theories that are in some sense natural extensions of cosmological Einstein's… 
2014
2014
Statistical Theory for High-Dimensional Models
These lecture notes consist of three chapters. In the first chapter we present oracle inequalities for the prediction error of… 
Highly Cited
2012
Highly Cited
2012
Pushing the Limits of High-Speed GF(2 m ) Elliptic Curve Scalar Multiplication on FPGAs
In this paper we present an FPGA implementation of a high-speed elliptic curve scalar multiplier for binary finite fields. High… 
2012
2012
A Mixture Model Approach for Formant Tracking and the Robustness of Student's-t Distribution
We address the problem of robust formant tracking in continuous speech in the presence of additive noise. We propose a new… 
2011
2011
Generic Complexity of Finitely Presented Monoids and Semigroups
We study the generic properties of finitely presented monoids and semigroups, and the generic-case complexity of decision… 
2011
2011
Assuring quality of an e-learning project through the PDCA approach
Purpose: The aim of the paper is to present the methodology used to manage an extensive e-learning project at the Czestochowa… 
2009
2009
iTasks 2: iTasks for End-users
Workflow management systems (WFMSs) are systems that generate, coordinate and monitor tasks performed by human workers in… 
2007
2007
Generic Complexity of Presburger Arithmetic
Fischer and Rabin proved in (Proceedings of the SIAM-AMS Symposium in Applied Mathematics, vol. 7, pp. 27–41, 1974) that the… 
2004
2004
Comparing the Performance of Two Consensus Algorithms with Centralized and Decentralized Communication Schemes
Comparing the Performance of Two Consensus Algorithms with Centralized and Decentralized Communication Schemes Peter Urban and… 
Review
1992
Review
1992
Generic Oracles, Uniform Machines, and Codes
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)