### Questions (4)

 4 Simple proof that finding a combinatorial map of a planar graph given as an incidence matrix can be done in polynomial time? 3 Finding the dichotomy that maximizes information gain for a classifier? 3 Complexity of / best algorithm for finding the dichotomy that maximizes information gain? 2 What is the complexity of Hamming nearest neighbor to a subspace …?

### Reputation (195)

This user has no recent positive reputation changes

 2 Finding the dichotomy that maximizes information gain for a classifier? 1 Sampling perfect matching uniformly at random

### Tags (14)

 2 entropy × 3 1 complexity-theory × 3 2 machine-learning × 3 1 algorithms × 2 2 optimization × 3 1 sampling 2 probability-theory × 2 1 matching 2 information-theory × 2 0 coding-theory × 2
{"ft_lang_label":"__label__en","ft_lang_prob":0.7337254,"math_prob":0.95507014,"size":515,"snap":"2019-26-2019-30","text_gpt3_token_len":130,"char_repetition_ratio":0.21135029,"word_repetition_ratio":0.051948052,"special_character_ratio":0.30485436,"punctuation_ratio":0.012048192,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9675418,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2019-07-24T02:20:43Z\",\"WARC-Record-ID\":\"<urn:uuid:93368f86-9f3e-43ec-b7e8-177743e61741>\",\"Content-Length\":\"105926\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:40075dec-e803-4b86-a0e0-985917e6f56d>\",\"WARC-Concurrent-To\":\"<urn:uuid:bf2aa74b-7248-43ee-b31f-69584cd41dac>\",\"WARC-IP-Address\":\"151.101.1.69\",\"WARC-Target-URI\":\"https://cs.stackexchange.com/users/66344/lorenzo?tab=topactivity\",\"WARC-Payload-Digest\":\"sha1:RZ3OGLG7A4Y4LSF2QPWF4KJAK7T7PAEG\",\"WARC-Block-Digest\":\"sha1:QJSFDU7ELM77ASVNOKDEBL2HDB25XIWN\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2019/CC-MAIN-2019-30/CC-MAIN-2019-30_segments_1563195530250.98_warc_CC-MAIN-20190724020454-20190724042454-00008.warc.gz\"}"}