Quasi-random Boolean functions. (English) Zbl 1543.94821
MSC:
94D10
Found 290 Documents (Results 1–100)
Randomness quality and trade-offs for CA random string generators. (English) Zbl 07930570
Bournez, Olivier (ed.) et al., Reachability problems. 17th international conference, RP 2023, Nice, France, October 11–13, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 14235, 3-12 (2023).
MSC:
68Qxx
Analysis and construction of nonlinear correctors used in true random number generators. (English) Zbl 07883526
Noise sensitivity and stability of deep neural networks for binary classification. (English) Zbl 1524.68318
On sequences of homomorphisms into measure algebras and the Efimov problem. (English) Zbl 1528.28005
The exact complexity of pseudorandom functions and the black-box natural proof barrier for bootstrapping results in computational complexity. (English) Zbl 07774392
Leonardi, Stefano (ed.) et al., Proceedings of the 54th annual ACM SIGACT symposium on theory of computing, STOC ’22, Rome, Italy June 20–24, 2022. New York, NY: Association for Computing Machinery (ACM). 962-975 (2022).
MSC:
68Qxx
Properties of the full class of quaternary bent-functions of two variables. (English) Zbl 1504.94190
Structural and statistical analysis of multidimensional linear approximations of random functions and permutations. (English) Zbl 1489.94085
On pseudorandom subsets in finite fields. I: Measure of pseudorandomness and support of Boolean functions. (English) Zbl 1499.11248
Reviewer: Nikolai L. Manev (Sofia)
Noise stability of weighted majority. (English) Zbl 1469.60341
Vares, Maria Eulália (ed.) et al., In and out of equilibrium 3: celebrating Vladas Sidoravicius. Cham: Birkhäuser. Prog. Probab. 77, 677-682 (2021).
Autonomous Boolean network and physical random number generator based on XOR gate. (Chinese. English summary) Zbl 1474.94064
Asymptotics of the number of threshold functions and the singularity probability of random \( \{\pm 1\}\)-matrices. (English. Russian original) Zbl 1474.60012
Dokl. Math. 101, No. 3, 247-249 (2020); translation from Dokl. Ross. Akad. Nauk, Mat. Inform. Protsessy Upr. 492, 89-91 (2020).
Towards a proof of the Fourier-entropy conjecture? (English) Zbl 1474.94058
Reviewer: Ioan Tomescu (Bucureşti)
Random tree recursions: which fixed points correspond to tangible sets of trees? (English) Zbl 1445.05028
Singularity of \(\{\pm 1\}\)-matrices and asymptotics of the number of threshold functions. arXiv:2004.03400
Preprint, arXiv:2004.03400 [math.CO] (2020).
\(\mathrm{AC}^0[p]\) lower bounds against MCSP via the coin problem. (English) Zbl 1524.68133
Baier, Christel (ed.) et al., 46th international colloquium on automata, languages, and programming, ICALP 2019, Patras, Greece, July 9–12, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 132, Article 66, 15 p. (2019).
Cubic formula size lower bounds based on compositions with majority. (English) Zbl 07559078
Blum, Avrim (ed.), 10th innovations in theoretical computer science conference, ITCS 2019, January 10–12, 2019, San Diego, CA, USA. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 124, Article 35, 13 p. (2019).
Pseudorandom generators from the second Fourier level and applications to AC0 with parity gates. (English) Zbl 1542.68051
Blum, Avrim (ed.), 10th innovations in theoretical computer science conference, ITCS 2019, January 10–12, 2019, San Diego, CA, USA. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 124, Article 22, 15 p. (2019).
Polynomial threshold functions, hyperplane arrangements, and random tensors. (English) Zbl 1499.94078
XOR codes and sparse learning parity with noise. (English) Zbl 1433.68265
Chan, Timothy M. (ed.), Proceedings of the 30th annual ACM-SIAM symposium on discrete algorithms, SODA 2019, San Diego, CA, USA, January 6–9, 2019. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 986-1004 (2019).
\(r\)-th order nonlinearity, correlation measure and least significant bit of the discrete logarithm. (English) Zbl 1419.94056
Exceptional times for percolation under exclusion dynamics. (English. French summary) Zbl 1426.82056
Reviewer: Piotr Garbaczewski (Opole)
WITHDRAWN: Quantum speedups need structure. arXiv:1911.03748
Preprint, arXiv:1911.03748 [cs.CC] (2019); retraction notice ibid.
A cryptographic and coding-theoretic perspective on the global rules of cellular automata. (English) Zbl 1532.68031
On the probabilistic degree of OR over the reals. (English) Zbl 1524.68131
Ganguly, Sumit (ed.) et al., 38th IARCS annual conference on foundations of software technology and theoretical computer science, FSTTCS 2018, Ahmedabad, India, December 11–13, 2018. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 122, Article 5, 12 p. (2018).
Pseudorandom generators for low sensitivity functions. (English) Zbl 1462.68051
Karlin, Anna R. (ed.), 9th innovations in theoretical computer science conference, ITCS 2018, Cambridge, MA, USA, January 11–14, 2018. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 94, Article 29, 13 p. (2018).
Pseudorandom generators from polarizing random walks. (English) Zbl 1441.68149
Servedio, Rocco A. (ed.), 33rd computational complexity conference, CCC 2018, June 22–24, 2018, San Diego, California, USA. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 102, Article 1, 21 p. (2018).
Fourier entropy influence conjecture for random linear threshold functions. (English) Zbl 1487.94208
Bender, Michael A. (ed.) et al., Latin 2018: theoretical informatics. 13th Latin American symposium, Buenos Aires, Argentina, April 16–19, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10807, 275-289 (2018).
Average-case lower bounds and satisfiability algorithms for small threshold circuits. (English) Zbl 1395.68138
Near Butson-Hadamard matrices and nonlinear Boolean functions. (English) Zbl 1423.94083
Kaczorowski, Jerzy (ed.) et al., Number-theoretic methods in cryptology. First international conference, NuTMiC 2017, Warsaw, Poland, September 11–13, 2017. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 10737, 254-266 (2018).
Book review of: C. Garban and J. E. Steif, Noise sensitivity of Boolean functions and percolation. (English) Zbl 1378.00064
Cryptographically weak filter function for trinomial linear recurrent sequences. (Russian. English summary) Zbl 1475.94135
Approximate bounded indistinguishability. (English) Zbl 1457.68121
Chatzigiannakis, Ioannis (ed.) et al., 44th international colloquium on automata, languages, and programming, ICALP 2017, Warsaw, Poland July 10–14, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 80, Article 53, 11 p. (2017).
Explicit resilient functions matching Ajtai-Linial. (English) Zbl 1410.68262
Klein, Philip N. (ed.), Proceedings of the 28th annual ACM-SIAM symposium on discrete algorithms, SODA 2017, Barcelona, Spain, January 16–19, 2017. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 1132-1148 (2017).
Scaling limits for the threshold window: when does a monotone Boolean function flip its outcome? (English. French summary) Zbl 1412.60052
Mean and variance of the number of subfunctions of random Boolean function which are close to the affine functions set. (English. Russian original) Zbl 1436.94129
Discrete Math. Appl. 27, No. 1, 23-34 (2017); translation from Diskretn. Mat. 27, No. 3, 108-122 (2015).
A polynomial restriction lemma with applications. (English) Zbl 1370.68223
Hatami, Hamed (ed.) et al., Proceedings of the 49th annual ACM SIGACT symposium on theory of computing, STOC ’17, Montreal, QC, Canada, June 19–23, 2017. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-4528-6). 615-628 (2017).
Approximate computations for binary Markov random fields and their use in Bayesian models. (English) Zbl 1505.62043
Nondeterministic communication complexity of random Boolean functions (extended abstract). (English) Zbl 1485.68099
Gopal, T. V. (ed.) et al., Theory and applications of models of computation. 14th annual conference, TAMC 2017, Bern, Switzerland, April 20–22, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10185, 529-542 (2017).
Extreme value estimation for a function of a random sample using binomial moments scheme and Boolean functions of events. (English) Zbl 1359.90083
Reviewer: Jerzy Ombach (Kraków)
Harmonicity and invariance on slices of the Boolean cube. (English) Zbl 1380.60021
Raz, Ran (ed.), 31st conference on computational complexity, CCC’16, Tokyo, Japan, May 29 – June 1, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-008-8). LIPIcs – Leibniz International Proceedings in Informatics 50, Article 16, 13 p. (2016).
Invariance principle on the slice. (English) Zbl 1380.60020
Raz, Ran (ed.), 31st conference on computational complexity, CCC’16, Tokyo, Japan, May 29 – June 1, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-008-8). LIPIcs – Leibniz International Proceedings in Informatics 50, Article 15, 10 p. (2016).
Degree and sensitivity: tails of two distributions. (English) Zbl 1380.68223
Raz, Ran (ed.), 31st conference on computational complexity, CCC’16, Tokyo, Japan, May 29 – June 1, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-008-8). LIPIcs – Leibniz International Proceedings in Informatics 50, Article 13, 23 p. (2016).
Super-linear gate and super-quadratic wire lower bounds for depth-two and depth-three threshold circuits. (English) Zbl 1373.68220
Wichs, Daniel (ed.) et al., Proceedings of the 48th annual ACM SIGACT symposium on theory of computing, STOC ’16, Cambridge, MA, USA, June 19–21, 2016. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-4132-5). 633-643 (2016).
The relation between tree size complexity and probability for Boolean functions generated by uniform random trees. (English) Zbl 1461.05178
Generalised and quotient models for random and/or trees and application to satisfiability. (English) Zbl 1355.68199
Correlation bounds and #SAT algorithms for small linear-size circuits. (English) Zbl 1353.68113
MSC:
68Q25
94C10
Near invariance of the hypercube. (English) Zbl 1350.15017
Reviewer: Francisco Marcellán (Leganes)
On the algorithm of detecting the essential arguments of random Boolean function. (Russian. English summary) Zbl 1476.94065
MSC:
94D10
Krawtchouk polynomials and their applications in cryptography and coding theory. (Russian. English summary) Zbl 1475.94124
Dynamics of complex Boolean networks: canalization, stability, and criticality. (English) Zbl 1359.92041
Robeva, Raina S. (ed.), Algebraic and discrete mathematical methods for modern biology. Amsterdam: Elsevier (ISBN 978-0-12-801213-0/hbk). 93-119 (2015).
Strong noise sensitivity and random graphs. (English) Zbl 1339.82005
Reviewer: Dominik Strzałka (Rzeszów)
Sharp thresholds for monotone non-Boolean functions and social choice theory. (English) Zbl 1409.91107
Boolean random functions. (English) Zbl 1366.60013
Schmidt, Volker (ed.), Stochastic geometry, spatial statistics and random fields. Models and algorithms. Selected papers based on the presentations at the summer academy on stochastic analysis, modelling and simulation of complex structures, Söllerhaus, Hirschegg, Germany, September 11–24, 2011. Cham: Springer (ISBN 978-3-319-10063-0/pbk; 978-3-319-10064-7/ebook). Lecture Notes in Mathematics 2120, 143-169 (2015).
Thresholds and expectation-thresholds of monotone properties with small minterms. (English) Zbl 1326.05141
Random permutations using switching networks. (English) Zbl 1321.65007
Proceedings of the 47th annual ACM symposium on theory of computing, STOC ’15, Portland, OR, USA, June 14–17, 2015. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-3536-2). 703-712 (2015).
MSC:
65C10
94C10
Noise sensitivity of Boolean functions and percolation. (English) Zbl 1355.06001
Institute of Mathematical Statistics Textbooks 5. Cambridge: Cambridge University Press (ISBN 978-1-107-07643-3/hbk; 978-1-107-43255-0/pbk; 978-1-139-92416-0/ebook). xvii, 203 p. (2015).
Reviewer: Ioan Tomescu (Bucureşti)
Asymptotic estimates for numbers of Boolean mappings with given cryptographic properties. (Russian. English summary) Zbl 1476.94074
Local limit theorem for the distribution of incomplete vector formed by the weights of subfunctions of random binary mapping components. (Russian. English summary) Zbl 1476.94073
Moments of weights of random nonuniform Boolean functions. (Russian. English summary) Zbl 1476.94081
MSC:
94D10
Social choice, computational complexity, Gaussian geometry, and Boolean functions. (English) Zbl 1375.91074
Jang, Sun Young (ed.) et al., Proceedings of the International Congress of Mathematicians (ICM 2014), Seoul, Korea, August 13–21, 2014. Vol. IV: Invited lectures. Seoul: KM Kyung Moon Sa (ISBN 978-89-6105-807-0/hbk; 978-89-6105-803-2/set). 633-658 (2014).
No Shannon effect induced by and/or trees. (English) Zbl 1352.94097
Bousquet-Mélou, Mireille (ed.) et al., Proceeding of the 25th international conference on probabilistic, combinatorial and asymptotic methods in the analysis of algorithms, AofA’14, UPMC-Jussieu, Paris, France, June 16–20, 2014. Nancy: The Association. Discrete Mathematics & Theoretical Computer Science (DMTCS). Discrete Mathematics and Theoretical Computer Science (DMTCS-HAL). Proceedings BA, 109-120 (2014).
MSC:
94C10
60C05
Advances on random sequence generation by uniform cellular automata. (English) Zbl 1323.68392
Calude, Cristian S. (ed.) et al., Computing with new resources. Essays dedicated to Jozef Gruska on the occasion of his 80th birthday. Cham: Springer (ISBN 978-3-319-13349-2/pbk; 978-3-319-13350-8/ebook). Lecture Notes in Computer Science 8808, 56-70 (2014).
On derandomizing algorithms that err extremely rarely. (English) Zbl 1315.68152
Proceedings of the 46th annual ACM symposium on theory of computing, STOC ’14, New York, NY, USA, May 31 – June 3, 2014. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-2710-7). 109-118 (2014).
Pseudorandom generators with optimal seed length for non-Boolean poly-size circuits. (English) Zbl 1315.68143
Proceedings of the 46th annual ACM symposium on theory of computing, STOC ’14, New York, NY, USA, May 31 – June 3, 2014. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-2710-7). 99-108 (2014).
Noise sensitivity in continuum percolation. (English) Zbl 1305.60100
Reviewer: Eugen Grycko (Hagen)
Threshold Boolean form for joint probabilistic constraints with random technology matrix. (English) Zbl 1297.90101
Math. Program. 147, No. 1-2 (A), 391-427 (2014); erratum ibid. 155, No. 1–2 (A), 617-620 (2016).
The monotone complexity of \(k\)-clique on random graphs. (English) Zbl 1304.68081
Reviewer: Václav Koubek (Praha)
Equivalence classes of random Boolean trees and application to the Catalan satisfiability problem. (English) Zbl 1351.68191
Pardo, Alberto (ed.) et al., LATIN 2014: theoretical informatics. 11th Latin American symposium, Montevideo, Uruguay, March 31 – April 4, 2014. Proceedings. Berlin: Springer (ISBN 978-3-642-54422-4/pbk). Lecture Notes in Computer Science 8392, 466-477 (2014).
Probabilities of 2-Xor functions. (English) Zbl 1351.68192
Pardo, Alberto (ed.) et al., LATIN 2014: theoretical informatics. 11th Latin American symposium, Montevideo, Uruguay, March 31 – April 4, 2014. Proceedings. Berlin: Springer (ISBN 978-3-642-54422-4/pbk). Lecture Notes in Computer Science 8392, 454-465 (2014).
The value of less connected agents in Boolean networks. (English) Zbl 1395.94392
MSC:
94C10
91B06
Filter Results by …
Document Type
- Journal Articles (213)
- Collection Articles (59)
- Books (15)
- arXiv Preprints (3)
all
top 5
Author
- Mailler, Cécile (8)
- Genitrini, Antoine (6)
- Gittenberger, Bernhard (6)
- Toman, Eduard (6)
- Weber, Karl F. E. (6)
- Wegener, Ingo (6)
- Mossel, Elchanan (5)
- O’Donnell, Ryan (5)
- Savir, Jacob (5)
- Steif, Jeffrey E. (5)
- Wimmer, Karl (5)
- Gardy, Danièle (4)
- Hatami, Pooya (4)
- Kabanets, Valentine (4)
- Kindler, Guy (4)
- Lovett, Shachar (4)
- Tal, Avishay (4)
- Ahlberg, Daniel (3)
- Chattopadhyay, Eshan (3)
- David, Rene (3)
- Filmus, Yuval (3)
- Fogelman Soulié, Françoise (3)
- Garban, Christophe (3)
- Impagliazzo, Russell (3)
- Kane, Daniel M. (3)
- Meier, Willi (3)
- Pippenger, Nicholas J. (3)
- Rodier, François (3)
- Servedio, Rocco A. (3)
- Škoviera, Martin (3)
- Srinivasan, Srikanth (3)
- Thevenod-Fosse, Pascale (3)
- Amano, Kazuyuki (2)
- Bardell, Paul H. (2)
- Bhandari, Siddharth (2)
- Bhattacharyya, Arnab (2)
- Bogdanov, Andrej (2)
- Carlet, Claude (2)
- Caullery, Florian (2)
- Chen, Ruiwen (2)
- Chung, Fan (2)
- de Panafieu, Elie (2)
- Dershowitz, Nachum (2)
- Férard, Éric (2)
- Gelfand, Alan Enoch (2)
- Golić, Jovan Dj. (2)
- Gopalan, Parikshit (2)
- Grigorescu, Elena (2)
- Harsha, Prahladh (2)
- Heinrich, Lothar (2)
- Hosseini, Kaave (2)
- Ibaraki, Toshihide (2)
- Kahn, Jeff D. (2)
- Klein, Peter Paul (2)
- Kraus, Veronika (2)
- Kuba, Markus F. (2)
- Kutyłowski, Mirosław (2)
- Levin, Vitaliĭ Il’ich (2)
- Malev, V. A. (2)
- Martin, Bruno (2)
- Masol, Volodymyr I. (2)
- Molli, Tulasimohan (2)
- Olejár, Daniel (2)
- Ono, Hirotaka (2)
- Pankov, Konstantin N. (2)
- Peres, Yuval (2)
- Raghavendra, Prasad (2)
- Roitman, Judith (2)
- Safra, Muli (2)
- Sapozhenko, Aleksandr Antonovich (2)
- Savický, Petr (2)
- Shapira, Asaf (2)
- Sieling, Detlef (2)
- Sobota, Damian (2)
- Tarasov, Valery V. (2)
- Tezuka, Shu (2)
- Tzameret, Iddo (2)
- Viola, Emanuele (2)
- Weisbuch, Gérard (2)
- Wigderson, Avi (2)
- Yagiura, Mutsunori (2)
- Zwick, Uri (2)
- Aaronson, Scott (1)
- Achlioptas, Dimitris (1)
- Agrawal, Rohit (1)
- Ajtai, Miklós (1)
- Alekseychuk, Anton Nikolaevich (1)
- Andrecut, M. (1)
- Arai, Masayuki (1)
- Artemenko, Sergei (1)
- Arvillias, Alexis C. (1)
- Ashur, Tomer (1)
- Austad, Haakon Michael (1)
- Babai, László (1)
- Bach, Eric (1)
- Balcar, Bohuslav (1)
- Baldi, Pierre (1)
- Barrett, Chris L. (1)
- Bazzan, Ana Lucia C. (1)
- Belovs, Aleksandrs (1)
- and 326 more Authors
all
top 5
Serial
- IEEE Trans. Comput. (14)
- IEEE Trans. Inf. Theory (9)
- SIAM J. Comput. (9)
- Random Struct. Algorithms (9)
- Mat. Vopr. Kriptografii (6)
- Discrete Appl. Math. (5)
- Comput. Complexity (5)
- Theory Comput. (5)
- Inf. Process. Lett. (4)
- Elektron. Informationsverarbeitung Kybernetik (4)
- Comb. Probab. Comput. (4)
- Autom. Control Comput. Sci. (3)
- Discrete Math. (3)
- Theor. Comput. Sci. (3)
- Acta Math. Univ. Comenianae (3)
- Comput. Artif. Intell. (3)
- SIAM J. Discrete Math. (3)
- Discrete Math. Appl. (3)
- Electron. J. Comb. (3)
- Dokl. Math. (3)
- Cryptogr. Commun. (3)
- ACM Trans. Comput. Theory (3)
- Isr. J. Math. (2)
- Bull. Math. Biol. (2)
- Fundam. Math. (2)
- J. Assoc. Comput. Mach. (2)
- J. Comput. Syst. Sci. (2)
- Algorithmica (2)
- J. Am. Math. Soc. (2)
- J. Cryptology (2)
- Autom. Remote Control (2)
- Stochastic Processes Appl. (2)
- Electron. Commun. Probab. (2)
- Chic. J. Theor. Comput. Sci. (2)
- Nauk. Visn. Uzhgorod. Univ., Ser. Mat. (2)
- Acta Inf. (1)
- Arch. Autom. Telemech. (1)
- Biol. Cybern. (1)
- Comput. Math. Appl. (1)
- J. Math. Phys. (1)
- J. Stat. Phys. (1)
- Metrika (1)
- Period. Math. Hung. (1)
- Physica A (1)
- Scand. J. Stat. (1)
- Zh. Vychisl. Mat. Mat. Fiz. (1)
- Math. Comput. (1)
- Avtom. Vychisl. Tekh. (Riga) (1)
- Acta Arith. (1)
- Ann. Probab. (1)
- Ann. Sci. Éc. Norm. Supér. (4) (1)
- Colloq. Math. (1)
- Computing (1)
- Duke Math. J. (1)
- IEEE Trans. Commun. (1)
- Inf. Control (1)
- Inf. Sci. (1)
- J. Lond. Math. Soc., II. Ser. (1)
- J. Symb. Log. (1)
- Math. Comput. Simul. (1)
- Math. Oper. Res. (1)
- RAIRO, Autom. Syst. Anal. Control (1)
- Topology Appl. (1)
- J. Digital Syst. (1)
- Cybern. Syst. (1)
- Physica D (1)
- Inf. Comput. (1)
- J. Inf. Process. Cybern. (1)
- Rev. Mat. Apl. (1)
- Neural Netw. (1)
- Syst. Sci. Math. Sci. (1)
- Appl. Math., Praha (1)
- Geom. Funct. Anal. (1)
- Comput. Math. Math. Phys. (1)
- Commun. ACM (1)
- Digital Processes (1)
- J. Phys. A, Math. Gen. (1)
- Probl. Peredachi Inf. (1)
- Z. Oper. Res., Ser. A (1)
- Bull. Am. Math. Soc., New Ser. (1)
- Ann. Inst. Henri Poincaré, Probab. Stat. (1)
- Arch. Math. Logic (1)
- Math. Program. (1)
- Australas. J. Comb. (1)
- Tatra Mt. Math. Publ. (1)
- Vopr. Kibern., Mosk. (1)
- Mult.-Valued Log. (1)
- Theory Comput. Syst. (1)
- Bull. Georgian Acad. Sci. (1)
- Diskretn. Anal. Issled. Oper., Ser. 1 (1)
- J. ACM (1)
- J. Discrete Math. Sci. Cryptography (1)
- Ann. Math. (2) (1)
- Visn., Ser. Fiz.-Mat. Nauky, Kyïv. Univ. Im. Tarasa Shevchenka (1)
- Fundam. Inform. (1)
- J. Shenzhen Univ., Sci. Eng. (1)
- Nonlinear Dyn. Syst. Theory (1)
- Comput. Inform. (1)
- J. Mach. Learn. Res. (1)
- Nat. Comput. (1)
- and 21 more Serials
all
top 5
Year of Publication
- 2024 (5)
- 2023 (5)
- 2022 (8)
- 2021 (5)
- 2020 (6)
- 2019 (11)
- 2018 (11)
- 2017 (11)
- 2016 (9)
- 2015 (11)
- 2014 (17)
- 2013 (9)
- 2012 (8)
- 2011 (7)
- 2010 (5)
- 2009 (6)
- 2008 (4)
- 2007 (4)
- 2006 (3)
- 2005 (2)
- 2004 (11)
- 2003 (5)
- 2002 (1)
- 2001 (8)
- 2000 (3)
- 1999 (4)
- 1998 (5)
- 1997 (2)
- 1996 (2)
- 1995 (4)
- 1994 (4)
- 1993 (2)
- 1992 (6)
- 1991 (6)
- 1990 (4)
- 1989 (2)
- 1988 (3)
- 1987 (10)
- 1986 (7)
- 1985 (5)
- 1984 (5)
- 1983 (8)
- 1982 (7)
- 1981 (1)
- 1980 (11)
- 1979 (6)
- 1978 (5)
- 1977 (1)
- 1974 (2)
- 1969 (1)
- 1967 (1)
- 1961 (1)
