Item request has been placed! ×
Item request cannot be made. ×
loading  Processing Request

Search Results

Display Settings
Results per page: 10
Sort By: Relevance
Filter

Your Filters

Language : aragonese Language : czech Language : english Language : igbo Language : italian Language : nauru Language : ndonga Language : uzbek Publisher : schloss dagstuhl--leibniz-zentrum fuer informatik Geographic : germany
Reset filters
Item request has been placed! ×
Item request cannot be made. ×
loading  Processing Request
Conference

Finding Cuts of Bounded Degree: Complexity, FPT and Exact Algorithms, and Kernelization

Subjects: Matching cut; Bounded degree cut; Parameterized complexityMunich; Germany

  • Source: IPEC 2019 - 14th International Symposium on Parameterized and Exact Computation ; https://hal-lirmm.ccsd.cnrs.fr/lirmm-02410703 ; IPEC 2019 - 14th International Symposium on Parameterized and Exact

Record details

Read More Add to Saved list
×
Conference

Template Games, Simple Games, and Day Convolution

Subjects: Game semantics; Day convolution; Categorical semanticsDortmund; Germany

  • Source: Leibniz International Proceedings in Informatics (LIPIcs) ; 4th International Conference on Formal Structures for Computation and Deduction (FSCD 2019) ; https://hal.archives-ouvertes.fr/hal-01897309

Record details

Read More Add to Saved list
×
Conference

Hilbert's Tenth Problem in Coq

Subjects: type theory; Coq; Hilbert's tenth problemDortmund; Germany

  • Source: 4th International Conference on Formal Structures for Computation and Deduction (FSCD 2019)4th International Conference on Formal Structures for Computation and Deduction, FSCD 2019

Record details

Read More Add to Saved list
×
Conference

Finding Cuts of Bounded Degree: Complexity, FPT and Exact Algorithms, and Kernelization

Subjects: Matching cut; Bounded degree cut; Parameterized complexityMunich; Germany

  • Source: 14th International Symposium on Parameterized and Exact Computation (IPEC)https://hal-lirmm.ccsd.cnrs.fr/lirmm-0241070314th International Symposium on Parameterized and Exact Computation

Record details

Read More Add to Saved list
×
Conference

Hilbert's Tenth Problem in Coq

Subjects: Minsky machines; many-one reductions; computability theoryDortmund; Germany

  • Source: 4th International Conference on Formal Structures for Computation and Deduction (FSCD 2019)4th International Conference on Formal Structures for Computation and Deduction, FSCD 2019

Record details

Read More Add to Saved list
×
Conference

On OBDD-Based Algorithms and Proof Systems That Dynamically Change Order of Variables

Subjects: Proof complexity; OBDD; error-correcting codesHannover; Germany

  • Source: 34th Symposium on Theoretical Aspects of Computer ScienceSTACS: Symposium on Theoretical Aspects of Computer Sciencehttps://hal-lirmm.ccsd.cnrs.fr/lirmm-01487646STACS: Symposium on

Record details

Read More Add to Saved list
×
Conference

On OBDD-Based Algorithms and Proof Systems That Dynamically Change Order of Variables

Subjects: Proof complexity; OBDD; error-correcting codesHannover; Germany

  • Source: 34th Symposium on Theoretical Aspects of Computer ScienceSTACS: Symposium on Theoretical Aspects of Computer Sciencehttps://hal-lirmm.ccsd.cnrs.fr/lirmm-01487646STACS: Symposium on

Record details

Read More Add to Saved list
×
Conference

On OBDD-Based Algorithms and Proof Systems That Dynamically Change Order of Variables

Subjects: Proof complexity; OBDD; error-correcting codesHannover; Germany

  • Source: 34th Symposium on Theoretical Aspects of Computer ScienceSTACS: Symposium on Theoretical Aspects of Computer Sciencehttps://hal-lirmm.ccsd.cnrs.fr/lirmm-01487646STACS: Symposium on

Record details

Read More Add to Saved list
×
Conference

On OBDD-Based Algorithms and Proof Systems That Dynamically Change Order of Variables

Subjects: Proof complexity; OBDD; error-correcting codesHannover; Germany

  • Source: 34th Symposium on Theoretical Aspects of Computer ScienceSTACS: Symposium on Theoretical Aspects of Computer Sciencehttps://hal-lirmm.ccsd.cnrs.fr/lirmm-01487646STACS: Symposium on

Record details

Read More Add to Saved list
×
Conference

The finiteness of a group generated by a 2-letter invertible-reversible Mealy automaton is decidable

Subjects: Mealy automata; automaton semigroups; decidability of finitenessKiel; Germany

  • Source: EISSN: 1868-8969 ; Leibniz International Proceedings in Informatics ; 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013) ; https://u-paris.hal.science/hal-00875177 ;

Record details

Read More Add to Saved list
×