Skip to main content
Paul Manta's user avatar
Paul Manta's user avatar
Paul Manta's user avatar
Paul Manta
  • Member for 12 years
  • Last seen more than 6 years ago
  • Amsterdam, Netherlands
awarded
awarded
awarded
awarded
revised
Loading…
comment
Is 2**x faster to compute than exp(x)?
@isomorphismes Here, 'subnormal' is with respect to how floats are implemented. See denormal numbers on Wikipedia.
awarded
awarded
awarded
awarded
revised
Loading…
Loading…
comment
K-Clique in Connected Graphs
Good point. Do you know, are there any (nontrivial) types of graphs for which the clique problem, where k is an input variable, can be solved in polynomial time?
awarded
comment
K-Clique in Connected Graphs
@Merbs Not really, but I suppose you mean to say that there's nothing about connected graphs that makes this problem easier?
comment
K-Clique in Connected Graphs
@Merbs Yes, I edited the question.
revised
K-Clique in Connected Graphs
added 10 characters in body; edited title
Loading…
awarded