One looks down over the coamings three hundred feet to the despatching-caisson whence voices boom upward.
"Actions and Reactions" by Rudyard Kipling
Then he climbed over the coaming and joined the men in the dory.
"El Diablo" by Brayton Norton
A gang of coolies with grate bars were trying to pry up the junk's coamings.
"Peter the Brazen" by George F. Worts
The coamings and seats are cut to the sizes indicated in the drawings.
"Boys' Book of Model Boats" by Raymond Francis Yates
I peer from the fore end of the engine-room over the hatch-coamings into the coach.
"With The Night Mail" by Rudyard Kipling
There was a bar, set into the coaming.
"The Enormous Room" by Horace Leonard Gold
Dropping the oars, he rose, grasped the coaming and lifted himself into the cockpit.
"The Destroying Angel" by Louis Joseph Vance
Examine the deck, particularly the joint with the coaming.
"Harper's Round Table, September 3, 1895" by Various
Henry, noticing the whiteness of her knuckles as she gripped the coaming, explained the disconcerting phenomena.
"Anna of the Five Towns" by Arnold Bennett
Cautiously the two blackened figures glided from the shelter of the bulwarks to the raised coaming of the engine-room fidley.
"Rounding up the Raider" by Percy F. Westerman
Taking a strong hook attached to a rope in his hand, he dived from the coaming of the hatchway.
"The Nameless Island" by Percy F. Westerman
Rising, Peter found that Olive Baird was standing outside the brass-rimmed coaming.
"The Wireless Officer" by Percy F. Westerman
He only wished to cower beside Harry under the partial shelter of the coaming.
"The Boy Ranchers of Puget Sound" by Harold Bindloss
Foam and water poured over the coamings in cataracts, and, seeing that otherwise a capsize was inevitable, I released the sheet.
"The Mistress of Bonaventure" by Harold Bindloss
They finished their task, and when Vane seized the helm Carroll sat down under the shelter of the coaming, out of the flying spray.
"The Protector" by Harold Bindloss
Macallister and Miguel occupied the hatch coaming, the captain the grating by the tiller.
"Kit Musgrave's Luck" by Harold Bindloss
A coaming just within the hawse hole.
"The Seaman's Friend" by Richard Henry Dana
Saving a little wrench when we hauled the cot over the coaming of the deck-house door, the poor man was put to no pain.
"My Danish Sweetheart., Volume 1 of 3" by William Clark Russell
By stooping, so as to bring my face on a level with the coaming, I could see the girl.
"My Danish Sweetheart., Volume 2 of 3" by William Clark Russell
There was a dark stain on the bare plank close against the coaming or ledge of the door of the Captain's cabin.
"My Danish Sweetheart, Volume 3 of 3" by William Clark Russell
It is easy to see that one-way permutations cannot be based on NP-completeness, unless NP = coNP (or AM = coAM if one allows randomized reductions, or NP/poly = coNP/poly if one allows non-uniform reductions).
Akavia et al. [AGGM06] prove that one-way functions cannot be based on NP-complete problems via non-adaptive reductions unless AM = coAM (see Section 7.3).
Then it is not diﬃcult to see that L must be in AM ∩ coAM (NP ∩ coNP if the reduction is deterministic).
It follows that the average-case hardness of any one-way permutation can be based, at best, on the worst-case hardness of some problem in AM ∩ coAM.
They observe that if there is a reduction from a language L to an adversary for an encryption scheme of this type, then L ∈ AM ∩ coAM.
On the other hand, Goldreich and Goldwasser [GG98a] showed that SVPγ (n) ∈ coAM for γ (n) = Ω(pn/ log n) and Aharonov and Regev [AR05] showed that SVPγ (n) ∈ coNP for γ (n) = Ω(√n).
It is interesting to observe that the one-way functions constructed by Ajtai [Ajt96] and Micciancio and Regev [MR04] are size-approximable (in fact, almost regular), so by Theorem 44 in the best case the hardness of these functions can be based on problems in AM ∩ coAM.
Moreover, the complexity class NP ∩ coAM that contains graph isomorphism is similar to NP ∩ coNP which contains the decision version of factoring — a problem that is solvable in quantum polynomial time using Shor’s algorithm .
Quantum Algorithms for Tree Isomorphism and State Symmetrization
In 2005, Hara, Tani, and Yamamoto claimed that unknottedness is in AM ∩ coAM.
Knottedness is in NP, modulo GRH