Stronger Lower Bounds and Randomness-Hardness Trade-Offs Using Associated Algebraic Complexity Classes

International audience

Data and Resources

Additional Info

Field Value
Source Symposium on Theoretical Aspects of Computer Science
Author Jansen, Maurice, Santhanam, Rahul
Maintainer CCSD
Last Updated May 25, 2026, 03:23 (UTC)
Created May 25, 2026, 03:23 (UTC)
Identifier hal-00678201
Language en
Rights https://about.hal.science/hal-authorisation-v1/
contributor Institute for Theoretical Computer Science (ITCS) ; Qing hua da xue = Tsinghua University = Université Tsinghoua [Beijing] (THU)
coverage Paris, France
creator Jansen, Maurice
date 2012-02-29T00:00:00
harvest_object_id d412631d-5085-4bca-994d-1eed1fd7cd88
harvest_source_id 3374d638-d20b-4672-ba96-a23232d55657
harvest_source_title test moissonnage SELUNE
metadata_modified 2026-03-11T00:00:00
set_spec type:COMM