Geography
From MaRDI portal
Publication:1210545
DOI10.1016/0304-3975(93)90356-XzbMath0799.90145OpenAlexW4211146495MaRDI QIDQ1210545
Shai Simonson, Aviezri S. Fraenkel
Publication date: 30 August 1993
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(93)90356-x
Related Items
On the computational complexities of various geography variants, test, On variants of vertex geography on undirected graphs, The complexity of mean payoff games on graphs, The shortest connection game, Vertex Nim played on graphs, Euclid after Computer Proof-Checking, flags, pah, QSAR-TID-12689, QSAR-TID-129, iris, yeast, autos, QSAR-TID-101360, QSAR-TID-12506, QSAR-TID-20109, QSAR-TID-127, iris, iris, QSAR-TID-14070, QSAR-TID-11119, QSAR-TID-101078, QSAR-TID-125, QSAR-TID-11279, QSAR-TID-184, QSAR-TID-10692, QSAR-TID-106, QSAR-TID-103453, QSAR-TID-11575, DBpedia(YAGO).arff, higgs, KEGGMetabolicReactionNetwork, PhishingWebsites, Census-Income, GesturePhaseSegmentationRAW, GesturePhaseSegmentationProcessed, Diabetes130US, thyroid-allhypo, CIFAR_10, langLog, jungle_chess_2pcs_endgame_panther_elephant, jungle_chess_2pcs_endgame_complete, STL-10, kick, helena, sf1, slump, MIP-2016-classification, FOREX_audcad-day-High, FOREX_cadchf-hour-High, FOREX_eurpln-hour-Close, FOREX_eurusd-minute-High, FOREX_eurrub-hour-Close, FOREX_eurdkk-minute-Close, FOREX_chfsgd-minute-Close, ilpd-numeric, SAT11-HAND-runtime-regression, public_procurement, kaggle_santander_p, colleges, compas-two-years, serie_a_matches_2015_2016, Mine, porto-seguro, Touch, Test_vectors_trans_posneg2, house_prices_nominal, train, Higgs, spo, WebMD-Drug-Reviews-Dataset, Pantheon-Project-Historical-Popularity-Index, california, electricity_seed_1_nrows_2000_nclasses_10_ncols_100_stratify_True, churn_seed_3_nrows_2000_nclasses_10_ncols_100_stratify_True, health_insurance, qsar, Colon, Ovarian, SMK, hailfinder_4, hailfinder_8, hailfinder_10, hepar2_0, hepar2_1, hepar2_2, Leukemia, CNS, Modular Nim, Undirected edge geography, Complexity of path-forming games, Impartial poker nim, On the shortest path game, Playing weighted Tron on trees
Cites Work
- Unnamed Item
- Unnamed Item
- Prohibiting repetitions makes playing games substantially harder
- Hex ist Pspace-vollständig. (Hex is Pspace-complete)
- Playing disjunctive sums is polynomial space complete
- Complexity of path-forming games
- On the complexity of some two-person perfect-information games
- GO Is Polynomial-Space Hard
- Planar Formulae and Their Uses
- A Solution of the Shannon Switching Game
