Unsolved problem in mathematics Which finite groups are BI-groups? More unsolved problems in mathematics Babai's problem is a problem in algebraic graph...
3 KB (357 words) - 07:39, 8 May 2024
5-polytopes – find and classify the complete set of these shapes Babai's problem: which groups are Babai invariant groups? Brouwer's conjecture on upper bounds...
195 KB (20,069 words) - 08:05, 26 June 2025
lecture linked from Babai's home page "The Graph Isomorphism Problem". Communications of the ACM. November 2020. Retrieved 4 May 2021. Babai, László (January...
41 KB (4,233 words) - 01:47, 25 June 2025
problem in computer science If the solution to a problem is easy to check for correctness, must the problem be easy to solve? More unsolved problems in...
63 KB (7,784 words) - 06:53, 25 April 2025
06:30 Curriculum vitae from Babai's web site, retrieved 2016-01-28. László Babai at the Mathematics Genealogy Project Babai, László; Moran, Shlomo (1988)...
12 KB (1,022 words) - 08:12, 22 March 2025
Graph isomorphism (redirect from Nonisomorphism problem)
the full journal version of Babai's paper has not yet been published. Its generalization, the subgraph isomorphism problem, is known to be NP-complete...
13 KB (1,637 words) - 19:43, 13 June 2025
Computational complexity theory (redirect from Intractable problem)
recent work by Babai offers some potentially new perspectives on this. The integer factorization problem is the computational problem of determining the...
50 KB (6,704 words) - 19:18, 26 May 2025
BPP (complexity) (redirect from P = BPP problem)
bounded-error probabilistic polynomial time (BPP) is the class of decision problems solvable by a probabilistic Turing machine in polynomial time with an error...
19 KB (2,456 words) - 20:16, 27 May 2025
Derangement (redirect from Hat-check problem)
"Some NP-complete problems similar to graph isomorphism". SIAM Journal on Computing. 10 (1): 11–21. doi:10.1137/0210002. MR 0605600. Babai, László (1995)...
27 KB (2,212 words) - 20:26, 28 June 2025
Paul Erdős (redirect from Erdős problems)
mathematical conjectures of the 20th century. Erdős pursued and proposed problems in discrete mathematics, graph theory, number theory, mathematical analysis...
51 KB (5,454 words) - 06:28, 25 June 2025
isomorphism problem is the decision problem of determining whether two given finite group presentations refer to isomorphic groups. The isomorphism problem was...
6 KB (627 words) - 03:20, 30 June 2025
Lovász conjecture (category Unsolved problems in graph theory)
Originally László Lovász stated the problem in the opposite way, but this version became standard. In 1996, László Babai published a conjecture sharply contradicting...
8 KB (1,003 words) - 00:04, 12 March 2025
number of rounds. While the designers of IP considered generalizations of Babai's interactive proof systems, others considered restrictions. A very useful...
23 KB (2,746 words) - 04:25, 4 January 2025
Baba'i ben Farhad (redirect from Babai ben Farhad)
Bābāī ibn Farhād". Proceedings of the American Academy for Jewish Research. 52: 141–157. doi:10.2307/3622705. ISSN 0065-6798. JSTOR 3622705. Bābāʼī ibn...
7 KB (715 words) - 06:28, 1 June 2025
quasipolynomial time algorithm for the graph isomorphism problem that was announced by László Babai in 2015. Babai subsequently fixed his proof. In 2008, Helfgott...
8 KB (610 words) - 13:32, 22 April 2025
introduced by László Babai in 1979, in the context of the graph isomorphism problem, as a dual to Monte Carlo algorithms. Babai introduced the term "Las...
17 KB (2,523 words) - 18:58, 15 June 2025
to John von Neumann in which Gödel asked whether a certain NP-complete problem could be solved in quadratic or linear time. The Gödel Prize has been awarded...
31 KB (2,200 words) - 21:16, 23 June 2025
the original on 1 November 2020. Retrieved 30 October 2020. "Dua Lipa dhe babai i saj u bëjnë thirrje qytetarëve të Kosovës që të dalin të votojnë më 14...
240 KB (19,141 words) - 10:13, 29 June 2025
may require cleanup to meet Wikipedia's quality standards. The specific problem is: cluttered, inconsistent, and confusing. Please help improve this section...
144 KB (13,962 words) - 19:43, 29 June 2025
Time complexity (redirect from Polynomial-time problem)
have to be independent of the problem size, but an upper bound for the running time has to be independent of the problem size. For example, the task "exchange...
41 KB (4,997 words) - 15:01, 30 May 2025
known as the PCP characterization theorem) states that every decision problem in the NP complexity class has probabilistically checkable proofs (proofs...
17 KB (2,076 words) - 06:27, 5 June 2025
group recognition and property testing. Notable algorithms include the Babai's algorithm for finding random group elements, the Product Replacement Algorithm...
4 KB (437 words) - 10:39, 20 August 2024
computational complexity theory, an Arthur–Merlin protocol, introduced by Babai (1985), is an interactive proof system in which the verifier's coin tosses...
12 KB (1,831 words) - 18:02, 19 April 2024
The use of Ijtihad and Taqlid associates with a religious and judicial problem that its answer is not in the Quran and hadith. Regarding Ijtihad, Halm...
103 KB (13,432 words) - 17:07, 28 June 2025
isolated subgraphs. It is closely related to the theory of network flow problems. The connectivity of a graph is an important measure of its resilience...
17 KB (2,062 words) - 23:37, 25 March 2025
Sadr al-Din al-Qunawi (section Problem of knowledge)
Alevism Qutb ad-Dīn Haydar – Malamatiyya / Qalandariyya Baba Ishak – Babai revolt Balım Sultan – Bektashi Order Galip Hassan Kuscuoglu – Galibi Order...
29 KB (4,132 words) - 01:49, 12 June 2025
ISBN 0-89791-099-0. Babai, László (June 23, 2019), Canonical Form for Graphs in Quasipolynomial Time Babai, László (1977), On the Isomorphism Problem, unpublished...
10 KB (1,115 words) - 00:15, 31 May 2025
concept dates back to work by Babai et al., and has been studied under various terms, including "checking computations" (Babai et al.), "delegating computations"...
14 KB (1,887 words) - 03:39, 2 January 2024
a streamlined predator with long jaws and sharp teeth. He also finds a problem: the sareng is sacred in India's Hindu religion and harming it is believed...
158 KB (685 words) - 10:18, 27 June 2025
along with László Babai and Carsten Lund, proved that MIP=NEXP. These algebraic techniques were expanded further by Fortnow, Babai, Leonid Levin and Mario...
10 KB (1,040 words) - 09:12, 4 January 2025