Reducibility among combinatorial problems. Zbl 0366.68041
Karp, R. M. |
|
1975
|
The complexity of theorem-proving procedures. Zbl 0363.68125
Cook, S. A. |
|
1975
|
Formal properties of grammars. Zbl 0156.25303
Chomsky, N. |
|
1963
|
Comparative schematology. Zbl 0401.68002
Paterson, M. S.; Hewitt, Carl E. |
|
1976
|
Outline of a mathematical theory of computation. Zbl 0419.68076
Scott, D. |
|
1977
|
The correctness of programs. Zbl 0285.68011
Manna, Z. |
|
1969
|
Isomorphism of planar graphs. Zbl 0436.05021
Hopcroft, J.; Tarjan, R. |
|
1972
|
Program schemes, recursion schemes and formal languages. Zbl 0369.68014
Garland, S. J.; Luckham, D. C. |
|
1976
|
On the combinational complexity of certain symmetric Boolean functions. Zbl 0444.94037
Stockmeyer, L. J. |
|
1979
|
Computational geometry - a survey. Zbl 0636.68048
Lee, D. T.; Preparata, Franco P. |
|
1987
|
A combinatorial problem. Zbl 0196.02803
de Bruijn, N. G. |
|
1946
|
Finitary models of language users. Zbl 0154.45602
Chomsky, N.; Miller, G. A. |
|
1967
|
Recent studies in automatic text analysis and document retrieval. Zbl 0363.68134
Salton, G. |
|
1975
|
Parallel program schemata. Zbl 0369.68013
Karp, R. M.; Miller, R. E. |
|
1976
|
Complexity of matrix multiplication. A survey. Zbl 0665.65039
Alekseev, V. B. |
|
1988
|
The effect of basis on size of Boolean expressions. Zbl 0469.94017
Pratt, V. R. |
|
1975
|
Block coding for the binary symmetric channel with noiseless, delayless feedback. Zbl 0253.94006
Berlekamp, E. R. |
|
1972
|
Decidability of second-order theories and automata on infinite trees. Zbl 0231.02056
Rabin, M. O. |
|
1971
|
NP-complete decision problems for binary quadratics. Zbl 0455.68029
Manders, K. L.; Adleman, L. |
|
1980
|
Schnelle Multiplikation großer Zahlen. Zbl 0271.68051
Schönhage, A.; Strassen, V. |
|
1973
|
Transition network grammars for natural language analysis. Zbl 0368.68081
Woods, W. A. |
|
1976
|
Log depth circuits for division and related problems. Zbl 0797.68074
Beame, Paul W.; Cook, Stephen A.; Hoover, H. James |
|
1986
|
The intractability of resolution. Zbl 0797.03010
Haken, Armin |
|
1985
|
The complexity of computing the permanent. Zbl 0551.68041
Valiant, L. G. |
|
1981
|
On realizability of a set of integers as degrees of the vertices of a linear graph. I. Zbl 0168.44705
Hakimi, S. L. |
|
1962
|
Solvability of machine mappings of regular sets to regular sets. Zbl 0192.08101
Ginsburg, S.; Hibbard, T. N. |
|
1966
|
On the computational complexity of algorithms. Zbl 0156.25604
Hartmanis, J.; Stearns, R. E. |
|
1967
|
A lower bound of the number of threshold functions. Zbl 0197.43606
Yajima, S.; Ibaraki, T. |
|
1969
|
A machine-oriented logic bases on the resolution principle. Zbl 0214.02501
Robinson, J. A. |
|
1970
|
A new polynomial-time algorithm for linear programming. Zbl 0684.90062
Karmarkar, N. |
|
1989
|
Top-down syntax analysis. Zbl 0407.68080
Knuth, Donald E. |
|
1978
|
Degrees of finite-state transformability. Zbl 0408.03038
Rayna, Gerhard |
|
1977
|
Mathematical theory of computation. Zbl 0408.68022
Manna, Zohar |
|
1978
|
The pattern discrimination problem from the perspective of relation theory. Zbl 0446.68079
Haralick, R. M. |
|
1979
|
Enumerative combinatorics and algebraic languages. Zbl 0684.68093
Viennot, Gerard |
|
1989
|
Lengths of formulas and elimination of quantifiers. Zbl 0271.02012
Hodes, L.; Specker, E. |
|
1973
|
Refutational theorem proving using term-rewriting systems. Zbl 0657.68097
Hsiang, Jieh |
|
1988
|
Universal unification and a classification of equational theories. Zbl 0564.68062
Siekman, J.; Szabo, P. |
|
1984
|
A regularity test for pushdown machines. Zbl 0231.90005
Stearns, R. E. |
|
1971
|
The complexity of partial derivatives. Zbl 0591.68046
Baur, Walter; Strassen, Volker |
|
1985
|
A combinatorial condition for planar graphs. Zbl 0213.50601
MacLane, S. |
|
1970
|
Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\). Zbl 0797.68075
Barrington, David A. |
|
1989
|
Foundations of pattern analysis. Zbl 0407.68088
Grenander, Ulf |
|
1978
|
On classes of program schemata. Zbl 0408.68019
Constable, Robert L.; Gries, David |
|
1977
|
Improved lower bounds on the number of multiplications/divisions which are necessary to evaluate polynomials. Zbl 0533.68041
Schnorr, C. P. |
|
1983
|
A synthesis of several sorting algorithms. Zbl 0551.68054
Darlington, John |
|
1981
|
On alternation. I. Zbl 0545.68039
Paul, Wolfgang J.; Prauss, Ernst J.; Reischuk, Ruediger |
|
1983
|
Existence of value and of saddle points for differential games of survival. Zbl 0253.90076
Friedman, Avner |
|
1972
|
A characterization of context-free languages. Zbl 0271.68057
Gruska, Jozef |
|
1973
|
An overview of the theory of computational complexity. Zbl 0289.68011
Hartmanis, J.; Hopcroft, J. E. |
|
1974
|
Weak monadic second order theory is not elementary-recursive. Zbl 0362.02034
Meyer, Albert R. |
|
1975
|
Lower bounds of the complexity of schemes of functional elements (a survey). Zbl 0584.94024
Khrapchenko, V. M. |
|
1984
|
On the minimum computation time of functions. Zbl 0231.02047
Cook, S. A.; Aanderaa, Stål O. |
|
1971
|
What makes some language theory problems undecidable. Zbl 0231.68031
Hartmanis, J.; Hopcroft, J. E. |
|
1971
|
Markov-renewal programming. I, II. Zbl 0166.15602
Jewell, W. S. |
|
1967
|
Strongly regular graphs and partial geometries. Zbl 0636.05013
Brouwer, A. E.; van Lint, J. H. |
|
1987
|
Contemporary methods for primality testing of numbers. A survey. Zbl 0669.10013
Vasilenko, O. N. |
|
1988
|
Definability and fast quantifier elimination in algebraically closed fields. Zbl 0589.03010
Heintz, Joos |
|
1985
|
Isomorphism of graphs of bounded valence can be tested in polynomial time. Zbl 0591.68064
Luks, Eugene M. |
|
1985
|
Graph isomorphism is in the low hierarchy. Zbl 0797.68076
Schoening, Uwe |
|
1988
|
Logarithmic depth circuits for algebraic functions. Zbl 0797.68072
Reif, John H. |
|
1986
|
Resolution proofs of generalized pigeonhole principles. Zbl 0797.03007
Buss, Samuel R.; Turán, György |
|
1988
|
The discrete geodesic problem. Zbl 0797.68150
Mitchell, Joseph S. B.; Mount, David M.; Papadimitriou, Christos H. |
|
1987
|
An \(O(n\log\log n)\)-time algorithm for triangulating a simple polygon. Zbl 0797.68073
Tarjan, Robert E.; van Wyk, Christopher J. |
|
1988
|
Negation is powerless for Boolean slice functions. Zbl 0797.94013
Valiant, L. G. |
|
1986
|
Graphs on unlabelled nodes with a large number of edges. Zbl 0414.05027
Wright, E. M. |
|
1977
|
Complexity of combinatorial algorithms. Zbl 0455.68028
Tarjan, Robert Endre |
|
1980
|
The depth of all Boolean functions. Zbl 0456.94025
McColl, W. F.; Paterson, M. S. |
|
1980
|
A multidimensional approach to syntactic pattern recognition. Zbl 0446.68078
Williams, Kenneth L. |
|
1979
|
Plane geometry theorem proving using forward chaining. Zbl 0446.68080
Nevins, Arthur J. |
|
1979
|
Developmental systems and languages in their biological context. Zbl 0455.68039
Lindenmayer, Aristid |
|
1980
|
On formalised computer programs. Zbl 0363.68027
Luckham, D. C.; Park, D. M. R.; Paterson, M. S. |
|
1975
|
Pattern recognition and group theory. Zbl 0551.68074
Richardson, J. M. |
|
1981
|
Advances and problems in mechanical proof procedures. Zbl 0269.68052
Prawitz, D. |
|
1972
|
An algorithm for imbedding cubic graphs in the torus. Zbl 0607.05029
Filotti, I. S. |
|
1986
|
Primality testing on a computer. Zbl 0607.10004
Williams, H. C. |
|
1986
|
Riemann’s hypothesis and tests for primality. Zbl 0607.68028
Miller, Gary L. |
|
1986
|
Random variables with independent binary digits. Zbl 0535.60013
Marsaglia, George |
|
1983
|
On alternation. II. A graph theoretic approach to determinism versus nondeterminism. Zbl 0545.68040
Paul, Wolfgang; Reischuk, Ruediger |
|
1983
|
On the definition of differential games and the existence of value and of saddle points. Zbl 0253.90075
Friedman, Avner |
|
1972
|
Substitution expressions. Zbl 0271.68060
McWhirter, I. P. |
|
1973
|
A survey of constructive coding theory and a table of binary codes of highest known rate. Zbl 0271.94005
Sloane, N. J. A. |
|
1973
|
Reduced forms for stochastic sequential machines. Zbl 0286.94050
Carlyle, J. W. |
|
1966
|
Primality testing and Jacobi sums. Zbl 0647.10009
Cohen, H.; Lenstra, H. W. jun. |
|
1987
|
Solving open questions with an automated theorem-proving program. Zbl 0564.68063
Wos, L. |
|
1984
|
Reachable zones in autonomous differential systems. Zbl 0145.33903
Roxin, E.; Spinadel, V. |
|
1963
|
On the problem of finding minimal programs for tables. Zbl 0214.01903
Pager, D. |
|
1970
|
Gaussian elimination is not optimal. Zbl 0214.40905
Strassen, V. |
|
1970
|
The structure and properties of binary cyclic alphabets. Zbl 0166.15504
MacWilliams, J. |
|
1967
|
Algebraische Theorie kontextfreier Sprachen. Zbl 0166.26504
Chomsky, N.; Schützenberger, M. P. |
|
1966
|
Nombre minimal de contacts de fermeture necessaires pour realiser une fonction booleenne symetrique de n variables. Zbl 0175.28202
Hansel, G. |
|
1968
|
Multi-tape and infinite-state automata. Zbl 0176.28103
Fischer, P. C. |
|
1968
|
Comma-free error-correcting codes. Zbl 0213.21302
Stiffler, J. J. |
|
1968
|
Steiner minimal trees. Zbl 0231.50005
Gilbert, E. N.; Pollak, H. O. |
|
1971
|
Strongly regular graphs. Zbl 0636.05030
Hubaut, Xavier L. |
|
1987
|
Linear programming in a Markov chain. Zbl 0158.38401
Wolfe, P.; Dantzig, G. B. |
|
1967
|
On the Shannon capacity of a graph. Zbl 0523.94016
Lovász, László |
|
1983
|
A Boolean function requiring \(3n\) network size. Zbl 0588.94015
Blum, Norbert |
|
1985
|
A new polynomial-time algorithm for linear programming. Zbl 0684.90062
Karmarkar, N. |
|
1989
|
Enumerative combinatorics and algebraic languages. Zbl 0684.68093
Viennot, Gerard |
|
1989
|
Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\). Zbl 0797.68075
Barrington, David A. |
|
1989
|
Complexity of matrix multiplication. A survey. Zbl 0665.65039
Alekseev, V. B. |
|
1988
|
Refutational theorem proving using term-rewriting systems. Zbl 0657.68097
Hsiang, Jieh |
|
1988
|
Contemporary methods for primality testing of numbers. A survey. Zbl 0669.10013
Vasilenko, O. N. |
|
1988
|
Graph isomorphism is in the low hierarchy. Zbl 0797.68076
Schoening, Uwe |
|
1988
|
Resolution proofs of generalized pigeonhole principles. Zbl 0797.03007
Buss, Samuel R.; Turán, György |
|
1988
|
An \(O(n\log\log n)\)-time algorithm for triangulating a simple polygon. Zbl 0797.68073
Tarjan, Robert E.; van Wyk, Christopher J. |
|
1988
|
Computational geometry - a survey. Zbl 0636.68048
Lee, D. T.; Preparata, Franco P. |
|
1987
|
Strongly regular graphs and partial geometries. Zbl 0636.05013
Brouwer, A. E.; van Lint, J. H. |
|
1987
|
The discrete geodesic problem. Zbl 0797.68150
Mitchell, Joseph S. B.; Mount, David M.; Papadimitriou, Christos H. |
|
1987
|
Primality testing and Jacobi sums. Zbl 0647.10009
Cohen, H.; Lenstra, H. W. jun. |
|
1987
|
Strongly regular graphs. Zbl 0636.05030
Hubaut, Xavier L. |
|
1987
|
Log depth circuits for division and related problems. Zbl 0797.68074
Beame, Paul W.; Cook, Stephen A.; Hoover, H. James |
|
1986
|
Logarithmic depth circuits for algebraic functions. Zbl 0797.68072
Reif, John H. |
|
1986
|
Negation is powerless for Boolean slice functions. Zbl 0797.94013
Valiant, L. G. |
|
1986
|
An algorithm for imbedding cubic graphs in the torus. Zbl 0607.05029
Filotti, I. S. |
|
1986
|
Primality testing on a computer. Zbl 0607.10004
Williams, H. C. |
|
1986
|
Riemann’s hypothesis and tests for primality. Zbl 0607.68028
Miller, Gary L. |
|
1986
|
The intractability of resolution. Zbl 0797.03010
Haken, Armin |
|
1985
|
The complexity of partial derivatives. Zbl 0591.68046
Baur, Walter; Strassen, Volker |
|
1985
|
Definability and fast quantifier elimination in algebraically closed fields. Zbl 0589.03010
Heintz, Joos |
|
1985
|
Isomorphism of graphs of bounded valence can be tested in polynomial time. Zbl 0591.68064
Luks, Eugene M. |
|
1985
|
A Boolean function requiring \(3n\) network size. Zbl 0588.94015
Blum, Norbert |
|
1985
|
Universal unification and a classification of equational theories. Zbl 0564.68062
Siekman, J.; Szabo, P. |
|
1984
|
Lower bounds of the complexity of schemes of functional elements (a survey). Zbl 0584.94024
Khrapchenko, V. M. |
|
1984
|
Solving open questions with an automated theorem-proving program. Zbl 0564.68063
Wos, L. |
|
1984
|
Improved lower bounds on the number of multiplications/divisions which are necessary to evaluate polynomials. Zbl 0533.68041
Schnorr, C. P. |
|
1983
|
On alternation. I. Zbl 0545.68039
Paul, Wolfgang J.; Prauss, Ernst J.; Reischuk, Ruediger |
|
1983
|
Random variables with independent binary digits. Zbl 0535.60013
Marsaglia, George |
|
1983
|
On alternation. II. A graph theoretic approach to determinism versus nondeterminism. Zbl 0545.68040
Paul, Wolfgang; Reischuk, Ruediger |
|
1983
|
On the Shannon capacity of a graph. Zbl 0523.94016
Lovász, László |
|
1983
|
The complexity of computing the permanent. Zbl 0551.68041
Valiant, L. G. |
|
1981
|
A synthesis of several sorting algorithms. Zbl 0551.68054
Darlington, John |
|
1981
|
Pattern recognition and group theory. Zbl 0551.68074
Richardson, J. M. |
|
1981
|
NP-complete decision problems for binary quadratics. Zbl 0455.68029
Manders, K. L.; Adleman, L. |
|
1980
|
Complexity of combinatorial algorithms. Zbl 0455.68028
Tarjan, Robert Endre |
|
1980
|
The depth of all Boolean functions. Zbl 0456.94025
McColl, W. F.; Paterson, M. S. |
|
1980
|
Developmental systems and languages in their biological context. Zbl 0455.68039
Lindenmayer, Aristid |
|
1980
|
On the combinational complexity of certain symmetric Boolean functions. Zbl 0444.94037
Stockmeyer, L. J. |
|
1979
|
The pattern discrimination problem from the perspective of relation theory. Zbl 0446.68079
Haralick, R. M. |
|
1979
|
A multidimensional approach to syntactic pattern recognition. Zbl 0446.68078
Williams, Kenneth L. |
|
1979
|
Plane geometry theorem proving using forward chaining. Zbl 0446.68080
Nevins, Arthur J. |
|
1979
|
Top-down syntax analysis. Zbl 0407.68080
Knuth, Donald E. |
|
1978
|
Mathematical theory of computation. Zbl 0408.68022
Manna, Zohar |
|
1978
|
Foundations of pattern analysis. Zbl 0407.68088
Grenander, Ulf |
|
1978
|
Outline of a mathematical theory of computation. Zbl 0419.68076
Scott, D. |
|
1977
|
Degrees of finite-state transformability. Zbl 0408.03038
Rayna, Gerhard |
|
1977
|
On classes of program schemata. Zbl 0408.68019
Constable, Robert L.; Gries, David |
|
1977
|
Graphs on unlabelled nodes with a large number of edges. Zbl 0414.05027
Wright, E. M. |
|
1977
|
Comparative schematology. Zbl 0401.68002
Paterson, M. S.; Hewitt, Carl E. |
|
1976
|
Program schemes, recursion schemes and formal languages. Zbl 0369.68014
Garland, S. J.; Luckham, D. C. |
|
1976
|
Parallel program schemata. Zbl 0369.68013
Karp, R. M.; Miller, R. E. |
|
1976
|
Transition network grammars for natural language analysis. Zbl 0368.68081
Woods, W. A. |
|
1976
|
Reducibility among combinatorial problems. Zbl 0366.68041
Karp, R. M. |
|
1975
|
The complexity of theorem-proving procedures. Zbl 0363.68125
Cook, S. A. |
|
1975
|
Recent studies in automatic text analysis and document retrieval. Zbl 0363.68134
Salton, G. |
|
1975
|
The effect of basis on size of Boolean expressions. Zbl 0469.94017
Pratt, V. R. |
|
1975
|
Weak monadic second order theory is not elementary-recursive. Zbl 0362.02034
Meyer, Albert R. |
|
1975
|
On formalised computer programs. Zbl 0363.68027
Luckham, D. C.; Park, D. M. R.; Paterson, M. S. |
|
1975
|
An overview of the theory of computational complexity. Zbl 0289.68011
Hartmanis, J.; Hopcroft, J. E. |
|
1974
|
Schnelle Multiplikation großer Zahlen. Zbl 0271.68051
Schönhage, A.; Strassen, V. |
|
1973
|
Lengths of formulas and elimination of quantifiers. Zbl 0271.02012
Hodes, L.; Specker, E. |
|
1973
|
A characterization of context-free languages. Zbl 0271.68057
Gruska, Jozef |
|
1973
|
Substitution expressions. Zbl 0271.68060
McWhirter, I. P. |
|
1973
|
A survey of constructive coding theory and a table of binary codes of highest known rate. Zbl 0271.94005
Sloane, N. J. A. |
|
1973
|
Isomorphism of planar graphs. Zbl 0436.05021
Hopcroft, J.; Tarjan, R. |
|
1972
|
Block coding for the binary symmetric channel with noiseless, delayless feedback. Zbl 0253.94006
Berlekamp, E. R. |
|
1972
|
Existence of value and of saddle points for differential games of survival. Zbl 0253.90076
Friedman, Avner |
|
1972
|
Advances and problems in mechanical proof procedures. Zbl 0269.68052
Prawitz, D. |
|
1972
|
On the definition of differential games and the existence of value and of saddle points. Zbl 0253.90075
Friedman, Avner |
|
1972
|
Decidability of second-order theories and automata on infinite trees. Zbl 0231.02056
Rabin, M. O. |
|
1971
|
A regularity test for pushdown machines. Zbl 0231.90005
Stearns, R. E. |
|
1971
|
On the minimum computation time of functions. Zbl 0231.02047
Cook, S. A.; Aanderaa, Stål O. |
|
1971
|
What makes some language theory problems undecidable. Zbl 0231.68031
Hartmanis, J.; Hopcroft, J. E. |
|
1971
|
Steiner minimal trees. Zbl 0231.50005
Gilbert, E. N.; Pollak, H. O. |
|
1971
|
A machine-oriented logic bases on the resolution principle. Zbl 0214.02501
Robinson, J. A. |
|
1970
|
A combinatorial condition for planar graphs. Zbl 0213.50601
MacLane, S. |
|
1970
|
On the problem of finding minimal programs for tables. Zbl 0214.01903
Pager, D. |
|
1970
|
Gaussian elimination is not optimal. Zbl 0214.40905
Strassen, V. |
|
1970
|
The correctness of programs. Zbl 0285.68011
Manna, Z. |
|
1969
|
A lower bound of the number of threshold functions. Zbl 0197.43606
Yajima, S.; Ibaraki, T. |
|
1969
|
Nombre minimal de contacts de fermeture necessaires pour realiser une fonction booleenne symetrique de n variables. Zbl 0175.28202
Hansel, G. |
|
1968
|
Multi-tape and infinite-state automata. Zbl 0176.28103
Fischer, P. C. |
|
1968
|
Comma-free error-correcting codes. Zbl 0213.21302
Stiffler, J. J. |
|
1968
|
Finitary models of language users. Zbl 0154.45602
Chomsky, N.; Miller, G. A. |
|
1967
|
On the computational complexity of algorithms. Zbl 0156.25604
Hartmanis, J.; Stearns, R. E. |
|
1967
|
Markov-renewal programming. I, II. Zbl 0166.15602
Jewell, W. S. |
|
1967
|
The structure and properties of binary cyclic alphabets. Zbl 0166.15504
MacWilliams, J. |
|
1967
|
Linear programming in a Markov chain. Zbl 0158.38401
Wolfe, P.; Dantzig, G. B. |
|
1967
|
Solvability of machine mappings of regular sets to regular sets. Zbl 0192.08101
Ginsburg, S.; Hibbard, T. N. |
|
1966
|
Reduced forms for stochastic sequential machines. Zbl 0286.94050
Carlyle, J. W. |
|
1966
|
Algebraische Theorie kontextfreier Sprachen. Zbl 0166.26504
Chomsky, N.; Schützenberger, M. P. |
|
1966
|
Formal properties of grammars. Zbl 0156.25303
Chomsky, N. |
|
1963
|
Reachable zones in autonomous differential systems. Zbl 0145.33903
Roxin, E.; Spinadel, V. |
|
1963
|
On realizability of a set of integers as degrees of the vertices of a linear graph. I. Zbl 0168.44705
Hakimi, S. L. |
|
1962
|
A combinatorial problem. Zbl 0196.02803
de Bruijn, N. G. |
|
1946
|