M > complexity | BibSonomy

publications (hide)49
display
all
publications only
publications per page
5
10
20
50
100
sort by
added at
title
author
publication date
entry type
help for advanced sorting...
RSS
BibTeX
RDF
more...

1Graph isomorphism problem
V. Zemlyachenko, N. Korneenko, and R. Tyshkevich. Journal of Soviet Mathematics, (1985)
a year ago by @hirth
show all tags
complexity
graph~isomorphism
complexitygraph~isomorphism
copydeleteadd this publication to your clipboard
3Fast-rate PAC-Bayes Generalization Bounds via Shifted Rademacher Processes
J. Yang, S. Sun, and D. Roy. (2019)
5 years ago by @kirk86
show all tags
complexity
generalization
bounds
neurips2019
complexitygeneralizationboundsneurips2019
copydeleteadd this publication to your clipboard
1Sparse multinomial logistic regression: fast algorithms and generalization bounds
B. Krishnapuram, L. Carin, M. Figueiredo, and A. Hartemink. IEEE Transactions on Pattern Analysis and Machine Intelligence, 27 (6): 957-968 (June 2005)
5 years ago by @kirk86
show all tags
complexity
sparsity
computation
complexitysparsitycomputation
copydeleteadd this publication to your clipboard
2Tradeoffs between Convergence Speed and Reconstruction Accuracy in Inverse Problems
R. Giryes, Y. Eldar, A. Bronstein, and G. Sapiro. (2016)cite arxiv:1605.09232Comment: To appear in IEEE Transactions on Signal Processing.
5 years ago by @kirk86
show all tags
complexity
readings
generalization
complexityreadingsgeneralization
copydeleteadd this publication to your clipboard
1The VC Dimension of Metric Balls under Fréchet and Hausdorff Distances
A. Driemel, J. Phillips, and I. Psarros. (2019)cite arxiv:1903.03211Comment: 23 pages, 5 figures.
5 years ago by @kirk86
show all tags
complexity
generalization
vc-dim
foundations
learning
theory
complexitygeneralizationvc-dimfoundationslearningtheory
copydeleteadd this publication to your clipboard
1Complexity in Chemistry
G. Whitesides, and R. Ismagilov. Science, 284 (5411): 89--92 (Apr 2, 1999)
5 years ago by @nonancourt
show all tags
complexity
complexity
copydeleteadd this publication to your clipboard
1Passing Messages Between Disciplines
M. Mézard. Science, 301 (5640): 1685--1686 (Sep 19, 2003)
5 years ago by @nonancourt
show all tags
critical-phenomena
k-sat,
complexity
metastability,
spin-glasses
critical-phenomenak-sat,complexitymetastability,spin-glasses
copydeleteadd this publication to your clipboard
1Core Percolation and Onset of Complexity in Boolean Networks
L. Correale, M. Leone, A. Pagnani, M. Weigt, and R. Zecchina. Physical Review Letters, (January 2006)
5 years ago by @nonancourt
show all tags
percolation
critical-phenomena
complexity
boolean\_networks,
core-periphery,
percolationcritical-phenomenacomplexityboolean\_networks,core-periphery,
copydeleteadd this publication to your clipboard
2The domino effect in complex systems: An interdisciplinary view
A. Farina, M. De Sanctis, E. Cianca, M. Coletta, M. Ruggieri, and P. Lindgren. Systems Engineering (ISSE), 2015 IEEE International Symposium on, page 291--297. IEEE, (2015)
5 years ago by @nonancourt
show all tags
cascades
complexity
networks
cascadescomplexitynetworks
copydeleteadd this publication to your clipboard
1Resource Letter CS–1: Complex Systems
M. Newman. American Journal of Physics, 79 (8): 800+ (Dec 6, 2011)
5 years ago by @nonancourt
show all tags
complexity
review
complexityreview
copydeleteadd this publication to your clipboard
5Stabbing Rectangles by Line Segments -- How Decomposition Reduces the Shallow-Cell Complexity
T. Chan, T. van Dijk, K. Fleszar, J. Spoerhase, and A. Wolff. Proc. 29th International Symposium on Algorithms and Computation (ISAAC'18), (2018)to appear.
6 years ago by @jspoerhase
show all tags
set
cover
myown
complexity
stabbing
approximability
geometric
rectangle
shallow-cell
setcovermyowncomplexitystabbingapproximabilitygeometricrectangleshallow-cell
copydeleteadd this publication to your clipboard
5Stabbing Rectangles by Line Segments – How Decomposition Reduces the Shallow-Cell Complexity
T. Chan, T. Dijk, K. Fleszar, J. Spoerhase, and A. Wolff. (2018)
7 years ago by @fleszark
show all tags
complexity
hardness
approximation
shallow-shell
algorithm
complexityhardnessapproximationshallow-shellalgorithm
copydeleteadd this publication to your clipboard
1AN IMPROVED LEADER ELECTION ALGORITHM FOR DISTRIBUTED SYSTEMS
P. BeaulahSoundarabai, T. Venugopal, and L. Patnaik. International Journal of Next-Generation Networks (IJNGN), 5 (1): 21 - 29 (March 2013)
7 years ago by @ijfls
show all tags
Coordinator
Message
Distributed
Ring
Algorithm
Election
Complexity
System
CoordinatorMessageDistributedRingAlgorithmElectionComplexitySystem
copydeleteadd this publication to your clipboard
2On modularity-np-completeness and beyond
U. Brandes, D. Delling, M. Gaertler, R. G\örke, M. Hoefer, Z. Nikoloski, and D. Wagner. (2006)
8 years ago by @ans
show all tags
np
complexity
modularity
npcomplexitymodularity
copydeleteadd this publication to your clipboard
1Parameterized Enumeration for Modification Problems
N. Creignou, R. Ktari, A. Meier, J. Müller, F. Olive, and H. Vollmer. Language and Automata Theory and Applications - 9th International Conference, LATA 2015, Nice, France, March 2-6, 2015, Proceedings, page 524--536. (2015)
9 years ago by @hvo
show all tags
myown
complexity
enumeration:problems
myowncomplexityenumeration:problems
copydeleteadd this publication to your clipboard
1A Van Benthem Theorem for Modal Team Semantics
J. Kontinen, J. Müller, H. Schnoor, and H. Vollmer. 24th EACSL Annual Conference on Computer Science Logic, CSL 2015, September 7-10, 2015, Berlin, Germany, page 277--291. (2015)
9 years ago by @hvo
show all tags
myown
complexity
modal:logic
myowncomplexitymodal:logic
copydeleteadd this publication to your clipboard
1Komplexität und Messung von Komplexität
M. Flückinger, and M. Rauterberg. ETH Zürich, (1995)
13 years ago by @naegle
show all tags
complexity
komplexitaet
complexitykomplexitaet
copydeleteadd this publication to your clipboard
1Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences)
M. Garey, and D. Johnson. W. H. Freeman, First Edition edition, (1979)
13 years ago by @folke
show all tags
science
np
complexity
tcs
computer
theoretical
sciencenpcomplexitytcscomputertheoretical
copydeleteadd this publication to your clipboard
1`` Strong '' NP-Completeness Results: Motivation, Examples, and Implications
M. Garey, and D. Johnson. J. ACM, (July 1978)
13 years ago by @pcbouman
show all tags
weak
np
complexity
strong
hard
article
weaknpcomplexitystronghardarticle
copydeleteadd this publication to your clipboard
7Reducibility Among Combinatorial Problems
R. Karp. Complexity of Computer Computations, Plenum Press, (1972)
13 years ago by @pcbouman
show all tags
np
karp
complexity
problems
hard
article
npkarpcomplexityproblemshardarticle
copydeleteadd this publication to your clipboard

⟨⟨
⟨
1
2
3
⟩
⟩⟩

publications (hide)49 displayallpublications onlypublications per page5102050100 sort byadded attitleauthorpublication dateentry typehelp for advanced sorting... RSSBibTeXRDFmore...

related tags

tags

publications (hide)49
display
all
publications only
publications per page
5
10
20
50
100
sort by
added at
title
author
publication date
entry type
help for advanced sorting...
RSS
BibTeX
RDF
more...