Sciweavers

1225 search results - page 18 / 245
» The Instance Complexity Conjecture
Sort
View
ICSE
2009
IEEE-ACM
14 years 7 days ago
Predicting faults using the complexity of code changes
Predicting the incidence of faults in code has been commonly associated with measuring complexity. In this paper, we propose complexity metrics that are based on the code change p...
Ahmed E. Hassan
COCO
2001
Springer
161views Algorithms» more  COCO 2001»
14 years 4 days ago
Communication Complexity Lower Bounds by Polynomials
The quantum version of communication complexity allows the two communicating parties to exchange qubits and/or to make use of prior entanglement (shared EPRpairs). Some lower boun...
Harry Buhrman, Ronald de Wolf
LICS
2009
IEEE
14 years 2 months ago
Trichotomy in the Complexity of Minimal Inference
We study the complexity of the propositional minimal inference problem. Its complexity has been extensively studied before because of its fundamental importance in artificial int...
Arnaud Durand, Miki Hermann, Gustav Nordh
STACS
2000
Springer
13 years 11 months ago
The Complexity of Planarity Testing
We clarify the computational complexity of planarity testing, by showing that planarity testing is hard for L, and lies in SL. This nearly settles the question, since it is widely...
Eric Allender, Meena Mahajan
JC
2008
92views more  JC 2008»
13 years 7 months ago
Characterizing Valiant's algebraic complexity classes
Valiant introduced 20 years ago an algebraic complexity theory to study the complexity of polynomial families. The basic computation model used is the arithmetic circuit, which ma...
Guillaume Malod, Natacha Portier