Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,632,929 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
20 relations
Algorithm
Anshel–Anshel–Goldfeld key exchange
Average-case complexity
Computational complexity theory
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Entropy in Born-Infeld gravity
Gokcen Deniz Ozen
,
Sahin Kurekci
,
B. Tekin
2017
Corpus ID: 119066369
There is a class of higher derivative gravity theories that are in some sense natural extensions of cosmological Einstein's…
Expand
2014
2014
Statistical Theory for High-Dimensional Models
S. Geer
2014
Corpus ID: 88519851
These lecture notes consist of three chapters. In the first chapter we present oracle inequalities for the prediction error of…
Expand
2012
2012
A Mixture Model Approach for Formant Tracking and the Robustness of Student's-t Distribution
S. Harshavardhan
,
C. Seelamantula
,
T. Sreenivas
IEEE Transactions on Audio, Speech, and Language…
2012
Corpus ID: 8455070
We address the problem of robust formant tracking in continuous speech in the presence of additive noise. We propose a new…
Expand
2011
2011
Generic Complexity of Finitely Presented Monoids and Semigroups
Mark Kambites
Computational Complexity
2011
Corpus ID: 31695925
We study the generic properties of finitely presented monoids and semigroups, and the generic-case complexity of decision…
Expand
2011
2011
Assuring quality of an e-learning project through the PDCA approach
T. Walasek
,
Z. Kucharczyk
,
D. Morawska-Walasek
2011
Corpus ID: 106416310
Purpose: The aim of the paper is to present the methodology used to manage an extensive e-learning project at the Czestochowa…
Expand
2007
2007
Generic Complexity of Presburger Arithmetic
A. Rybalov
Theory of Computing Systems
2007
Corpus ID: 30862417
Fischer and Rabin proved in (Proceedings of the SIAM-AMS Symposium in Applied Mathematics, vol. 7, pp. 27–41, 1974) that the…
Expand
2006
2006
Known/Chosen Key Attacks against Software Instruction Set Randomization
Y. Weiss
,
E. G. Barrantes
Asia-Pacific Computer Systems Architecture…
2006
Corpus ID: 14907336
Instruction set randomization (ISR) has been proposed as a form of defense against binary code injection into an executing…
Expand
2006
2006
Comparative Study of Refactoring Haskell and Erlang Programs
Huiqing Li
,
S. Thompson
Sixth IEEE International Workshop on Source Code…
2006
Corpus ID: 1957061
Refactoring is about changing the design of existing code without changing its behaviour, but with the aim of making code easier…
Expand
1996
1996
Generic algebras
E. Tevelev
1996
Corpus ID: 16418683
The paper studies generic commutative and anticommutative algebras of a fixed dimension, their invariants, covariants and…
Expand
Review
1992
Review
1992
Generic Oracles, Uniform Machines, and Codes
M. Dowd
Information and Computation
1992
Corpus ID: 19989357
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)
ACCEPT & CONTINUE