default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChicago Journal of Theoretical Computer Science, Volume 2014
Volume 2014, 2014
- Thomas Watson:
Lift-and-Project Integrality Gaps for the Traveling Salesperson Problem. - Thomas Thierauf, Fabian Wagner:
Reachability in K{3, 3}-free and K5-free Graphs is in Unambiguous Logspace. - Mark Huber:
Near-linear time simulation of linear extensions of a height-2 poset with bounded interaction. - Ansis Rosmanis:
Quantum Adversary Lower Bound for Element Distinctness with Small Range. - B. V. Raghavendra Rao, Jayalal Sarma:
Complexity of Testing Reachability in Matroids. - Ashley Montanaro:
A composition theorem for decision tree complexity. - Peter J. Cameron, Ben Fairbairn, Maximilien Gadouleau:
Computing in Permutation Groups Without Memory. - Peter J. Cameron, Ben Fairbairn, Maximilien Gadouleau:
Computing in Matrix Groups Without Memory. - Avraham Ben-Aroya, Igor Shinkar:
A Note on Subspace Evasive Sets. - Hirotada Kobayashi, Keiji Matsumoto, Seiichiro Tani:
Simpler Exact Leader Election via Quantum Reduction.
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-31 21:47 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
