( en | de | ru )

 

Disambiguation of "Craciun, Adrian"

Author of the publication

copydeleteadd this publication to your clipboard
Theorema: Towards computer-aided mathematical theory exploration.

, , , , , , , , , , and . J. Appl. Log., 4 (4): 470-504 (2006)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Catrinel Craciun

Eugenia Maria Craciun

Adrian Jonescu

Adrian Forster

Adrian Dohna

 

Other publications of authors with the same name

Short Proofs of the Kneser-Lovász Coloring Principle., , , , and . ICALP (2), volume 9135 of Lecture Notes in Computer Science, page 44-55. Springer, (2015)Proof Complexity and the Kneser-Lovász Theorem (I)., and . CoRR, (2014)Short proofs of the Kneser-Lovász coloring principle., , , , and . Inf. Comput., (2018)Decompositions of Natural Numbers: From a Case Study in Mathematical Theory Exploration., and . SYNASC, page 41-47. IEEE Computer Society, (2007)Factorizations of Regular Hedge Languages., and . SYNASC, page 307-314. IEEE Computer Society, (2009)Type Inference for Regular Expression Pattern Matching., and . SYNASC, page 366-373. IEEE Computer Society, (2010)Gröbner Bases with Reduction Machines., and . FROM, volume 303 of EPTCS, page 61-75. (2019)Theorema: Towards computer-aided mathematical theory exploration., , , , , , , , , and 1 other author(s). J. Appl. Log., 4 (4): 470-504 (2006)Scheme-Based Systematic Exploration of Natural Numbers., and . SYNASC, page 23-34. IEEE Computer Society, (2006)Proof Complexity and the Kneser-Lovász Theorem., and . SAT, volume 8561 of Lecture Notes in Computer Science, page 138-153. Springer, (2014)