![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Chicago 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.
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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.