Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Reducibility by Zhegalkin-linear tables

From MaRDI portal
Publication:1149947
Jump to:navigation, search

DOI10.1007/BF00968176zbMath0455.03019MaRDI QIDQ1149947

V. K. Bulitko

Publication date: 1981

Published in: Siberian Mathematical Journal (Search for Journal in Brave)


zbMATH Keywords

recursively enumerable classes of Boolean functionstabular Post reducibilities


Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30)


Related Items (2)

On the main scientific achievements of Victor Selivanov ⋮ Polynomial clone reducibility



Cites Work

  • Unnamed Item
  • Some Notions of Reducibility and Productiveness
  • Semirecursive Sets and Positive Reducibility


This page was built for publication: Reducibility by Zhegalkin-linear tables

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1149947&oldid=13209297"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 04:20.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki