Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "Complete and tractable machine-independent characterizations of second-order polytime."
@inproceedings{DBLP:conf/fossacs/HainryKMP22, author = {Emmanuel Hainry and Bruce M. Kapron and Jean{-}Yves Marion and Romain P{\'{e}}choux}, editor = {Patricia Bouyer and Lutz Schr{\"{o}}der}, title = {Complete and tractable machine-independent characterizations of second-order polytime}, booktitle = {Foundations of Software Science and Computation Structures - 25th International Conference, {FOSSACS} 2022, Held as Part of the European Joint Conferences on Theory and Practice of Software, {ETAPS} 2022, Munich, Germany, April 2-7, 2022, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {13242}, pages = {368--388}, publisher = {Springer}, year = {2022}, url = {https://doi.org/10.1007/978-3-030-99253-8\_19}, doi = {10.1007/978-3-030-99253-8\_19}, timestamp = {Wed, 18 May 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/fossacs/HainryKMP22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2208-14739, author = {Emmanuel Hainry and Bruce M. Kapron and Jean{-}Yves Marion and Romain P{\'{e}}choux}, title = {Complete and tractable machine-independent characterizations of second-order polytime}, journal = {CoRR}, volume = {abs/2208.14739}, year = {2022}, url = {https://doi.org/10.48550/arXiv.2208.14739}, doi = {10.48550/ARXIV.2208.14739}, eprinttype = {arXiv}, eprint = {2208.14739}, timestamp = {Thu, 01 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2208-14739.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.