default search action
Theoretical Computer Science, Volume 902
Volume 902, January 2022
- Juan José Besa Vial, Timothy Johnson, Nil Mamano, Martha C. Osegueda, Parker Williams:
Taming the knight's tour: Minimizing turns and crossings. 1-20 - Prosenjit Bose, Saeed Mehrabi, Debajyoti Mondal:
Parameterized complexity of two-interval pattern problem. 21-28 - Yuniel Matos-Rodríguez, Evaristo José Madarro-Capó, Carlos Miguel Legón-Pérez, Omar Rojas, Guillermo Sosa Gómez:
Improvements in the computing efficiency of the probabilities of the LIL test for the PRNG evaluation. 29-40 - Minh Thuy Truc Pham, Ngoc Ai Van Nguyen, Mei Jiang, Dung Hoang Duong, Willy Susilo:
Wildcarded identity-based encryption from lattices. 41-53 - João Guilherme Fritsche Colombo, Jerusa Marchi:
A nondeterministic Turing machine variant to compute functions. 54-63 - Khaled M. Elbassioni:
Quasi-polynomial algorithms for list-coloring of nearly intersecting hypergraphs. 64-75 - Nick Brettell, Matthew Johnson, Giacomo Paesani, Daniël Paulusma:
Computing subset transversals in H-free graphs. 76-92
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.