Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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

Related topics

Related topics

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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Frameworks with Forced Symmetry I: Reflections and Rotations
We give a combinatorial characterization of generic frameworks that are minimally rigid under the additional constraint of… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2012
2012
Generic computability, Turing degrees, and asymptotic density
Generic decidability has been extensively studied in group theory, and we now study it in the context of classical computability… Expand
Is this relevant?
2011
2011
Sensor localization with deterministic accuracy guarantee
Localizability of network or node is an important subproblem in sensor localization. While rigidity theory plays an important… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 7
Is this relevant?
2007
2007
Report on Generic Case Complexity
This article is a short introduction to generic case complexity, which is a recently developed way of measuring the difficulty of… Expand
Is this relevant?
2006
2006
Comparative Study of Refactoring Haskell and Erlang Programs
Refactoring is about changing the design of existing code without changing its behaviour, but with the aim of making code easier… Expand
  • figure 1
  • figure 7
  • figure 9
  • figure 10
Is this relevant?
2005
2005
Measuring the fitness relationship
It is widely acknowledged that the system functionality captured in a system model has to match organisational requirements… Expand
  • figure 2
  • table 1
  • table 2
  • table 3
  • table 4
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Efficient particle filtering for jump Markov systems. Application to time-varying autoregressions
We present an efficient particle filtering method to perform optimal estimation in jump Markov (nonlinear) systems (JMSs). Such… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2002
Highly Cited
2002
Generic-case complexity, decision problems in group theory and random walks
Abstract We give a precise definition of “generic-case complexity” and show that for a very large class of finitely generated… Expand
Is this relevant?
Highly Cited
2002
Highly Cited
2002
Generic ILP versus specialized 0-1 ILP: an update
Optimized solvers for the Boolean Satisfiability (SAT) problem have many applications in areas such as hardware and software… Expand
  • figure 1
  • figure 2
  • table 1
  • table 2
  • table 3
Is this relevant?
Highly Cited
1999
Highly Cited
1999
Weak Hopf algebras: II. Representation theory, dimensions, and the Markov trace
Abstract If A is a weak C *-Hopf algebra then the category of finite-dimensional unitary representations of A is a monoidal C… Expand
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE