default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 421
Volume 421, March 2012
- Ali Çivril
, Malik Magdon-Ismail:
Column subset selection via sparse approximation of SVD. 1-14 - Bhadrachalam Chitturi, Ivan Hal Sudborough:
Bounding prefix transposition distance for strings and permutations. 15-24 - Harold S. Connamacher:
Exact thresholds for DPLL on random XOR-SAT and NP-complete extensions of XOR-SAT. 25-55 - Khaled M. Elbassioni, Hans Raj Tiwary:
Complexity of approximating the vertex centroid of a polyhedron. 56-61 - Shiying Wang, Yuxing Yang:
Fault tolerance in bubble-sort graph networks. 62-69
- Alan Guo:
Winning strategies for aperiodic subtraction games. 70-73
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:48 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:
