The following pages link to Etsuji Tomita (Q638533):
Displaying 25 items.
- Learning Boolean functions in \(AC^0\)on attribute and classification noise -- estimating an upper bound on attribute and classification noise (Q638534) (← links)
- Polynomial time learning of simple deterministic languages via queries and a representative sample (Q706625) (← links)
- An extended direct branching algorithm for checking equivalence of deterministic pushdown automata (Q801689) (← links)
- Erratum: An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments (Q839051) (← links)
- The worst-case time complexity for generating all maximal cliques and computational experiments (Q860810) (← links)
- An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments (Q868636) (← links)
- A weaker sufficient condition for the equivalence of a pair of DPDA's to be decidable (Q1075060) (← links)
- A direct branching algorithm for checking the equivalence of two deterministic pushdown transducers, one of which is real-time strict (Q1124364) (← links)
- A direct branching algorithm for checking equivalence of strict deterministic vs. LL(k) grammars (Q1838320) (← links)
- The extended equivalence problem for a class of non-real-time deterministic pushdown automata (Q1894681) (← links)
- On the overall and delay complexity of the CLIQUES and Bron-Kerbosch algorithms (Q2062119) (← links)
- Overall and delay complexity of the CLIQUES and Bron-Kerbosch algorithms (Q2232246) (← links)
- (Q2743817) (← links)
- (Q2754024) (← links)
- Efficient Algorithms for Finding Maximum and Maximal Cliques and Their Applications (Q2980894) (← links)
- (Q3112179) (← links)
- A direct branching algorithm for checking equivalence of some classes of deterministic pushdown automata (Q3327736) (← links)
- A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique (Q3404446) (← links)
- A Unified Algorithm for Extending Classes of Languages Identifiable in the Limit from Positive Data (Q3541856) (← links)
- Polynomial Time Identification of Strict Prefix Deterministic Finite State Transducers (Q3588394) (← links)
- (Q4452109) (← links)
- A Much Faster Branch-and-Bound Algorithm for Finding a Maximum Clique (Q4632188) (← links)
- Computing and Combinatorics (Q4681173) (← links)
- Algorithmic Learning Theory (Q5464490) (← links)
- Grammatical Inference: Algorithms and Applications (Q5493028) (← links)
