Sciweavers

10608 search results - page 46 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
COCO
1993
Springer
108views Algorithms» more  COCO 1993»
14 years 2 months ago
Some Structural Complexity Aspects of Neural Computation
José L. Balcázar, Ricard Gavald&agra...
ECCC
2007
90views more  ECCC 2007»
13 years 10 months ago
Parameterized Proof Complexity: a Complexity Gap for Parameterized Tree-like Resolution
We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are not fixed-parameter tractable. We consider proofs that witness that a given pro...
Stefan S. Dantchev, Barnaby Martin, Stefan Szeider
JDA
2006
59views more  JDA 2006»
13 years 10 months ago
A note on the complexity of minimum dominating set
The currently (asymptotically) fastest algorithm for minimum dominating set on graphs of n nodes is the trivial (2n) algorithm which enumerates and checks all the subsets of
Fabrizio Grandoni

Book
393views
15 years 7 months ago
Computational Modeling and Complexity Science
"This book is about data structures and algorithms, intermediate programming in Python, complexity science and the philosophy of science"
Allen B. Downey
STOC
2002
ACM
105views Algorithms» more  STOC 2002»
14 years 10 months ago
Approximating the smallest grammar: Kolmogorov complexity in natural models
Moses Charikar, Eric Lehman, Ding Liu, Rina Panigr...