Pongrácz, András
- Reducts of the random partial order
2011/11/30 by Péter Pál Pach, Pach, Péter Pál, Michael Pinsker +7 · 2 citations
Computer Science · Mathematics · #Advanced Topology and Set Theory #Combinatorics (math.CO) #Computability, Logic, AI Algorithms #FOS: Mathematics #Limits and Structures in Graph Theory #Logic (math.LO)
- Constraint satisfaction problems for reducts of homogeneous graphs
2016/02/18 by Bodirsky, Manuel, Martin, Barnaby, Pinsker, Michael +1 · 3 citations
#Computational Complexity (cs.CC) #FOS: Computer and information sciences #FOS: Mathematics #Logic (math.LO) #Logic in Computer Science (cs.LO)
- A new operation on partially ordered sets
2012/08/16 by Péter Pál Pach, Pach, Péter Pál, Michael Pinsker +5 · 1 citation
Computer Science · Mathematics · #Combinatorics (math.CO) #FOS: Mathematics #Graph theory and applications #Limits and Structures in Graph Theory #Logic (math.LO) #semigroups and automata theory
- The universal homogeneous binary tree
2014/09/07 by Bodirsky, Manuel, Bradley-Williams, David, Pinsker, Michael +1 · 1 citation
#Combinatorics (math.CO) #Computational Complexity (cs.CC) #FOS: Computer and information sciences #FOS: Mathematics #Logic (math.LO)
- Reconstructing the topology of clones
2013/12/30 by Bodirsky, Manuel, Pinsker, Michael, Pongrácz, András · 1 citation
#FOS: Computer and information sciences #FOS: Mathematics #Logic (math.LO) #Logic in Computer Science (cs.LO) #Rings and Algebras (math.RA)
- On Diophantine graphs
2024/10/26 by Gergő Batta, Batta, Gergő, Lajos Hajdu +3 · 1 citation
Mathematics · #05C15 #05C42 #11D09 #11D25 #11D75 #Commutative Algebra and Its Applications #FOS: Mathematics #Number Theory (math.NT)